Affiliation:
1. Univ. of Pisa, Pisa, Italy
Abstract
The theory of abstract interpretation provides a formal framework to develop advanced dataflow analysis tools. The idea is to define a nonstandard semantics which is able to compute, in finite time, an approximated model of the program. In this paper, we define an abstract interpretation framework based on a fixpoint approach to the semantics. This leads to the definition, by means of a suitable set of operators, of an abstract fixpoint characterization of a model associated with the program. Thus, we obtain a specializable abstract framework for bottom-up abstract interpretations of definite logic programs. The specialization of the framework is shown on two examples, namely, gound-dependence analysis and depth-
k
analysis.
Publisher
Association for Computing Machinery (ACM)
Reference53 articles.
1. An introduction to abstract interpretation;ABRAMSKY S.;Abstract Interpretatwn ofDeclarative Languages. Ellis Horwood,1987
2. A structured approach to static semantics correctness;BARBUTI R.;Sc~. Comput. Prog.,1983
3. Recognizing non-fioundering logSc progTams and goals;BARBUTI R.;Inter. J. Found. Comput. Sci,1990
Cited by
59 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Accelerating Program Analyses in Datalog by Merging Library Facts;Static Analysis;2021
2. Mode Analysis During Program Development;International Journal on Artificial Intelligence Tools;2016-04
3. Abstract interpretation;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14
4. A compact fixpoint semantics for term rewriting systems;Theoretical Computer Science;2010-08
5. Theoretical Foundations and Semantics of Logic Programming;Lecture Notes in Computer Science;2010