Higher-Order and Symbolic Computation, 16(4)341-377
Path Dependent Analysis of Logic ProgramsLunjin Lu, Oakland University, Rochester, MI 48309, USA
|
Abstract: This paper presents an abstract semantics that uses
information about execution paths to improve precision of data flow
analyses of logic programs. The abstract semantics is illustrated by
abstracting execution paths using call strings of fixed length and the
last transfer of control. Abstract domains that have been developed
for logic program analyses can be used with the new abstract semantics
without modification.
Keywords: Abstract interpretation, Context sensitive analysis, Call strings |
This article can be downloaded [here].