A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Path dependent analysis of logic programs
2002
Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation - PEPM '02
Preserved Fulltext
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.
doi:10.1145/503032.503038
dblp:conf/pepm/Lu02
fatcat:wnv2nj5s7bfkvbiudemunaynzu