Please use this identifier to cite or link to this item:
|Title:||Enhancing program verification with lemmas|
|Authors:||Nguyen, H.H. |
|Citation:||Nguyen, H.H.,Chin, W.-N. (2008). Enhancing program verification with lemmas. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5123 LNCS : 355-369. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-540-70545-1_34|
|Abstract:||One promising approach to verifying heap-manipulating programs is based on user-defined inductive predicates in separation logic. This approach can describe data structures with complex invariants and sound reasoning based on unfold/fold. However, an important component towards more expressive program verification is the use of lemmas that can soundly relate predicates beyond their original definitions. This paper outlines a new automatic mechanism for proving and applying user-specified lemmas under separation logic. © 2008 Springer-Verlag.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 17, 2018
checked on Dec 8, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.