Abstract
We consider the problem of automatically verifying programs that manipulate a dynamic heap, maintaining complex and multiple data-structures, given modular pre-post conditions and loop invariants. We discuss specification logics for heaps, and discuss two classes of automatic procedures for reasoning with these logics. The first identifies fragments of logics that admit completely decidable reasoning. The second is a new approach called the natural proof method that builds proof procedures for very expressive logics that are automatic and sound (but incomplete), and that embody natural proof tactics learnt from manual verification.
| Original language | English (US) |
|---|---|
| Title of host publication | 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012 |
| Pages | 34-35 |
| Number of pages | 2 |
| Volume | 18 |
| DOIs | |
| State | Published - 2012 |
| Event | 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012 - Hyderabad, India Duration: Dec 15 2012 → Dec 17 2012 |
Other
| Other | 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012 |
|---|---|
| Country/Territory | India |
| City | Hyderabad |
| Period | 12/15/12 → 12/17/12 |
Keywords
- Data structures
- Heap structures
- Logic
- Program verification
ASJC Scopus subject areas
- Software