@inproceedings{saglam-lopstr97,
author={H. Saglam and J. P. Gallagher},
title={Constrained Regular Approximation of Logic Programs},
booktitle={Program Synthesis and Transformation. 7th International Workshop, LOPSTR'97, Leuven, Belgium, July 1997, editor N. Fuchs.},
ISBN={3-540-65074-1},
publisher={Springer Verlag, Lecture notes in Computer Science, Volume 1463},
pages={282--299},
month={June},
year={1998},
abstract={Regular approximation is a well-known and useful analysis technique for conventional logic programming. Given the existence of constraint solving techniques, one may wish to obtain more precise approximations of programs while retaining the decidable properties of the approximation. Greater precision could increase the effectiveness of applications that make use of regular approximation, such as the detection of useless clauses and type analysis. In this paper, we introduce arithmetic constraints, based on convex polyhedra, into regular approximation. In addition, Herbrand constraints can be introduced to capture dependencies among arguments. },
abstract-url={http://www.cs.bris.ac.uk/Publications/pub_master.jsp?id=1000299},
keyword={Declarative Systems,Logic Programming,Program Analysis},
pubtype={102}
}