119 search results - page 2 / 24 » Reasoning about Lists via List Interleaving |
SCAM
2006
IEEE
13 years 11 months ago
2006
IEEE
Traditional program slicing requires two parameters: a program location and a variable, or perhaps a set of variables, of interest. Stop-list slicing adds a third parameter to the...
VSTTE
2012
Springer
12 years 13 days ago
2012
Springer
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
SEFM
2006
IEEE
13 years 11 months ago
2006
IEEE
The key to many approaches to reason about pointerbased data structures is the availability of a decision procedure to automatically discharge proof obligations in a theory encomp...
CAV
2010
Springer
13 years 8 months ago
2010
Springer
We address the issue of automatic invariant synthesis for sequential programs manipulating singly-linked lists carrying data over infinite data doe define for that a framework ba...
POPL
2006
ACM
14 years 5 months ago
2006
ACM
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...