14 search results - page 1 / 3 » Invariant Synthesis for Programs Manipulating Lists with Unb... |
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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
POPL
2006
ACM
14 years 4 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...
FOSSACS
2009
Springer
13 years 11 months ago
2009
Springer
Standard analysis on recursive data structures restrict their attention to shape properties (for instance, a program that manipulates a list returns a list), excluding properties t...
POPL
2002
ACM
14 years 4 months ago
2002
ACM
e Abstraction for Software Verification Cormac Flanagan Shaz Qadeer Compaq Systems Research Center 130 Lytton Ave, Palo Alto, CA 94301 Software verification is an important and di...