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
相关论文
共 13 条
[1]  
ABRAMSKY S, 1987, ABSTRACT INTERPRETAT
[2]  
ABRAMSKY S, IN PRESS LOGIC COMPU, V1, P1
[3]  
BANACH R, LNCS, V366, P55
[4]  
BARENDREGT HP, 1987, LECT NOTES COMPUT SC, V259, P141
[5]  
BARENDREGT HP, INFORMATION COMPUTAT, V75, P191
[6]  
Cousot P., 1977, POPL, P238, DOI [DOI 10.1145/512950.512973, 10.1145/512950.512973]
[7]  
GOLDBERG B, LNCS, V201, P382
[8]  
HUDAK P, 1987, ABSTRACT INTERPRETAT, P45
[9]  
Jones N.D., 1987, ABSTRACT INTERPRETAT, P103
[10]  
KENNAWAY JR, THEORETICAL COMPUTER, V52, P37
12