STATIC ANALYSIS OF TERM GRAPH REWRITING-SYSTEMS

被引：0

作者：

HANKIN, C

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1991年 / 506卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

In this paper we present a framework for the abstract interpretation of term graph rewriting systems. The framework is based on the approach taken by the Cousots for flowchart programs. We give an example of the use of the framework by presenting an interpretation which performs a form of type inference.

引用

页码：367 / 384

页数：18

共 50 条

[31] MODULAR PROPERTIES OF CONDITIONAL TERM REWRITING-SYSTEMS
MIDDELDORP, A
INFORMATION AND COMPUTATION, 1993, 104 (01) : 110 - 158
[32] TRANSFINITE REDUCTIONS IN ORTHOGONAL TERM REWRITING-SYSTEMS
KENNAWAY, R
KLOP, JW
SLEEP, R
DEVRIES, FJ
INFORMATION AND COMPUTATION, 1995, 119 (01) : 18 - 38
[33] DECIDABILITY OF CONFLUENCE FOR GROUND TERM REWRITING-SYSTEMS
DAUCHET, M
TISON, S
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 80 - 89
[34] A COMPILER FOR A CLASS OF CONDITIONAL TERM REWRITING-SYSTEMS
GESER, A
HUSSMANN, H
MUCK, A
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 308 : 84 - 90
[35] COMPILATION OF GROUND TERM REWRITING-SYSTEMS AND APPLICATIONS
DAUCHET, M
DERUYVER, A
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 355 : 556 - 558
[36] A PARALLEL COMPLETION PROCEDURE FOR TERM REWRITING-SYSTEMS
YELICK, KA
GARLAND, SJ
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1992, 607 : 109 - 123
[37] ALGEBRAIC SEMANTICS AND COMPLEXITY OF TERM REWRITING-SYSTEMS
NAOI, T
INAGAKI, Y
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 355 : 311 - 325
[38] ON GROUND-CONFLUENCE OF TERM REWRITING-SYSTEMS
KAPUR, D
NARENDRAN, P
OTTO, F
INFORMATION AND COMPUTATION, 1990, 86 (01) : 14 - 31
[39] ANIGRAF - AN INTERACTIVE SYSTEM FOR THE ANIMATION OF GRAPH REWRITING-SYSTEMS WITH PRIORITIES
BILLAUD, M
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 488 : 437 - 438
[40] LINEARIZING TERM REWRITING-SYSTEMS USING TEST SETS
HOFBAUER, D
HUBER, M
JOURNAL OF SYMBOLIC COMPUTATION, 1994, 17 (01) : 91 - 129

← 1 2 3 4 5 →