Name
Abstract | ||
|---|---|---|
Separation Logic with inductive definitions is a well-known approach for deductive verification of programs that manipulate dynamic data structures. Deciding verification conditions in this context is usually based on user-provided lemmas relating the inductive definitions. We propose a novel approach for generating these lemmas automatically which is based on simple syntactic criteria and deterministic strategies for applying them. Our approach focuses on iterative programs, although it can be applied to recursive programs as well, and specifications that describe not only the shape of the data structures, but also their content or their size. Empirically, we find that our approach is powerful enough to deal with sophisticated benchmarks, e. g., iterative procedures for searching, inserting, or deleting elements in sorted lists, binary search tress, red-black trees, and AVL trees, in a very efficient way. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-24953-7_7 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Data structure,Discrete mathematics,Separation logic,AVL tree,Programming language,Computer science,Theoretical computer science,Binary search algorithm,Syntax,Binary search tree,Lemma (mathematics),Recursion | Journal | 9364 |
ISSN | Citations | PageRank |
0302-9743 | 10 | 0.53 |
References | Authors | |
19 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Constantin Enea | 1 | 249 | 26.95 |
| Mihaela Sighireanu | 2 | 658 | 37.99 |
| Zhilin Wu | 3 | 80 | 14.53 |