Abstracting numeric constraints with Boolean functions

被引:3
作者
Howe, JM [1 ]
King, A [1 ]
机构
[1] Univ Kent, Comp Lab, Canterbury CT2 7NF, Kent, England
基金
英国工程与自然科学研究理事会;
关键词
abstract interpretation; compilers; constraint programming;
D O I
10.1016/S0020-0190(00)00081-8
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A simple, syntactic algorithm for abstracting numeric constraints for groundness analysis is presented and proved correct. The technique uses neither projection nor temporary variables, and plugs a gap in the abstract interpretation literature. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:17 / 23
页数:7
相关论文
共 9 条
[1]   Two classes of Boolean functions for dependency analysis [J].
Armstrong, T ;
Marriott, K ;
Schachte, P ;
Sondergaard, H .
SCIENCE OF COMPUTER PROGRAMMING, 1998, 31 (01) :3-45
[2]  
Baker N., 1993, Australian Computer Science Communications, V15, P321
[3]   Analyzing logic programs using ''prop''-ositional logic programs and a magic wand [J].
Codish, M ;
Demoen, B .
JOURNAL OF LOGIC PROGRAMMING, 1995, 25 (03) :249-274
[4]   Global analysis of constraint logic programs [J].
DeLaBanda, MG ;
Hermenegildo, M ;
Bruynooghe, M ;
Dumortier, V ;
Janssens, G ;
Simoens, W .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1996, 18 (05) :564-614
[5]  
Garcia de la Banda M., 1994, THESIS U POLITECNICA
[6]  
HEATON A, IN PRESS J LOGIC PRO
[7]  
HEINTZE N, 1991, CLP R PROGRAMMERS MA
[8]  
Howe JM, 2000, LECT NOTES COMPUT SC, V1782, P200
[9]  
King A, 1999, LECT NOTES COMPUT SC, V1576, P59