Abstract
The classical theoretical framework for static analysis of programs is abstract interpretation. Much of the power and elegance of that framework rests on the assumption that an abstract domain is a lattice. Nonetheless, and for good reason, the literature on program analysis provides many examples of non-lattice domains, including non-convex numeric domains. The lack of domain structure, however, has negative consequences, both for the precision of program analysis and for the termination of standard Kleene iteration. In this paper we explore these consequences and present general remedies. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Gange, G., Navas, J. A., Schachte, P., Søndergaard, H., & Stuckey, P. J. (2013). Abstract interpretation over non-lattice abstract domains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7935 LNCS, pp. 6–24). https://doi.org/10.1007/978-3-642-38856-9_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
