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.
Original language | English |
---|---|
Title of host publication | Static Analysis - 20th International Symposium, SAS 2013, Proceedings |
Publisher | Springer |
Pages | 6-24 |
Number of pages | 19 |
ISBN (Print) | 9783642388552 |
DOIs | |
Publication status | Published - 26 Sep 2013 |
Externally published | Yes |
Event | Static Analysis Symposium 2013 - Seattle, United States of America Duration: 20 Jun 2013 → 22 Jun 2013 Conference number: 20th https://link.springer.com/book/10.1007/978-3-642-38856-9 (Proceedings) |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 7935 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | Static Analysis Symposium 2013 |
---|---|
Abbreviated title | SAS 2013 |
Country/Territory | United States of America |
City | Seattle |
Period | 20/06/13 → 22/06/13 |
Internet address |
|