122 search results - page 21 / 25 » Completeness of Pointer Program Verification by Separation L... |
88
Voted
CADE
2010
Springer
14 years 10 months ago
2010
Springer
Craig interpolation has become a versatile tool in formal verification, for instance to generate intermediate assertions for safety analysis of programs. Interpolants are typically...
166
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
HASE
2007
IEEE
15 years 1 months ago
2007
IEEE
Automated verification plays an important role for high assurance software. This typically uses a pair of pre/post conditions as a formal (but possibly partial) specification of e...
110
click to vote
PASTE
2010
ACM
14 years 11 months ago
2010
ACM
Many analysis techniques have been proposed to determine when a potentially null value may be dereferenced. But we have observed in practice that not every potential null derefere...
167
click to vote
POPL
2004
ACM
15 years 9 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...