Affiliation:
1. Oakland University, Michigan
Abstract
This paper presents an abstract semantics that uses information about execution paths to improve precision of data flow analyses of logic programs. We illustrate the abstract semantics 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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference43 articles.
1. R. Barbuti and R. Giacobazzi. A bottom-up polymorphic type inference in logic programming. Science of computer programming 19(3):133-181 1992. 10.1016/0167-6423(92)90038-D R. Barbuti and R. Giacobazzi. A bottom-up polymorphic type inference in logic programming. Science of computer programming 19(3):133-181 1992. 10.1016/0167-6423(92)90038-D
2. A general framework for semantics-based bottom-up abstract interpretation of logic programs
3. A practical framework for theabstract interpretation of logic programs
4. Experimental evaluation of a generic abstract interpretation algorithm for PROLOG
5. Bottom-up abstract interpretation of logic programs