Abstract
We revisit relational static analysis of numeric variables. Such analyses face two difficulties. First, even inexpensive relational domains scale too poorly to be practical for large code-bases. Second, to remain tractable they have extremely coarse handling of non-linear relations. In this paper, we introduce the subterm domain, a weakly relational abstract domain for inferring equivalences amongst sub- expressions, based on the theory of uninterpreted functions. This pro- vides an extremely cheap approach for enriching non-relational domains with relational information, and enhances precision of both relational and non-relational domains in the presence of non-linear operations. We evaluate the idea in the context of the software verification tool Sea Horn.
Original language | English |
---|---|
Title of host publication | Verification, Model Checking, and Abstract Interpretation |
Subtitle of host publication | 17th International Conference, VMCAI 2016 St. Petersburg, FL, USA, January 17–19, 2016 Proceedings |
Editors | Barbara Jobstmann, K. Rustan M. Leino |
Place of Publication | Berlin Germany |
Publisher | Springer |
Pages | 85-103 |
Number of pages | 19 |
ISBN (Electronic) | 9783662491225 |
ISBN (Print) | 9783662491218 |
DOIs | |
Publication status | Published - 2016 |
Externally published | Yes |
Event | Verification, Model Checking and Abstract Interpretation 2016 - St. Petersburg, United States of America Duration: 17 Jan 2016 → 19 Jan 2016 Conference number: 17th https://conf.researchr.org/home/VMCAI-2016 |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 9583 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | Verification, Model Checking and Abstract Interpretation 2016 |
---|---|
Abbreviated title | VMCAI 2016 |
Country/Territory | United States of America |
City | St. Petersburg |
Period | 17/01/16 → 19/01/16 |
Internet address |