8 search results - page 1 / 2 » A Logic of Reachable Patterns in Linked Data-Structures |
97
Voted
FOSSACS
2006
Springer
15 years 1 months ago
2006
Springer
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
77
Voted
CADE
2005
Springer
15 years 10 months ago
2005
Springer
101
Voted
SEFM
2006
IEEE
15 years 4 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...
IPPS
2006
IEEE
15 years 4 months ago
2006
IEEE
We present an overview of the Jahob system for modular analysis of data structure properties. Jahob uses a subset of Java as the implementation language and annotations with formu...
109
click to vote
ATVA
2007
Springer
15 years 4 months ago
2007
Springer
Automated software verification has made great progress recently, and a key enabler of this progress has been the advances in efficient, automated decision procedures suitable fo...