Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Path dependent analysis of logic programs

Path dependent analysis of logic programs 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGPLAN Notices Association for Computing Machinery

Path dependent analysis of logic programs

ACM SIGPLAN Notices , Volume 37 (3) – Mar 1, 2002

Loading next page...
 
/lp/association-for-computing-machinery/path-dependent-analysis-of-logic-programs-bHZVX8VaWS

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2002 by ACM Inc.
ISSN
0362-1340
DOI
10.1145/509799.503038
Publisher site
See Article on Publisher Site

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.

Journal

ACM SIGPLAN NoticesAssociation for Computing Machinery

Published: Mar 1, 2002

There are no references for this article.