Name
Abstract | ||
|---|---|---|
We extend off-the-shelf shape analyses with the ability to infer numeric relations between directly or indirectly connected heap cells. Specifically, we introduce the concept of connectors, an instrumentation that retains relations between heap cells even if these cells are merged into summary nodes. Managing connectors is based on applying generic fold and expand operations on a numeric abstract domain. Connectors are thus a universal tool to enhance shape analyses with any numeric analysis. We show how connectors provide the ability to infer invariants of non-trivial heap structures such as sorted/skip lists and search trees. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-17524-9_24 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Computer science,Skip list,Algorithm,Heap (data structure),Invariant (mathematics),Numerical analysis,Shape analysis (digital geometry) | Conference | 9058 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
14 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Holger Siegel | 1 | 11 | 1.92 |
| Axel Simon | 2 | 168 | 13.32 |