160 search results - page 20 / 32 » Structuring the verification of heap-manipulating programs |
129
click to vote
POPL
2000
ACM
15 years 6 months ago
2000
ACM
with existing analysis tools. Modular reasoning principles such as abstraction, compositional refinement, and assume-guarantee reasoning are well understood for architectural hiera...
256
click to vote
POPL
2009
ACM
16 years 3 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
230
click to vote
POPL
2009
ACM
16 years 3 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...
125
Voted
POPL
2010
ACM
16 years 20 days ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
133
click to vote
ESOP
2010
Springer
16 years 19 days ago
2010
Springer
Type-based amortised resource analysis following Hofmann and Jost--where resources are associated with individual elements of data structures and doled out to the programmer under ...