146 search results - page 6 / 30 » Local Reasoning about Programs that Alter Data Structures |
CVPR
2012
IEEE
13 years 2 days ago
2012
IEEE
We present a unified occlusion model for object instance detection under arbitrary viewpoint. Whereas previous approaches primarily modeled local coherency of occlusions or attem...
142
click to vote
POPL
2011
ACM
14 years 14 days ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
LISA
2004
14 years 11 months ago
2004
Periodic data backup is a system administration requirement that has changed as wireless machines have altered the fundamental structure of networks. These changes necessitate a c...
ESOP
2003
Springer
15 years 2 months ago
2003
Springer
This paper proposes the use of constraint logic programming (CLP) to perform model checking of traditional, imperative programs. We present a semantics-preserving translation from ...
TACAS
2007
Springer
15 years 3 months ago
2007
Springer
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...