37 search results - page 4 / 8 » Automatic Termination Proofs for Programs with Shape-Shiftin... |
POPL
2012
ACM
13 years 7 months ago
2012
ACM
Separation Logic has witnessed tremendous success in recent years in reasoning about programs that deal with heap storage. Its success owes to the fundamental principle that one s...
100
click to vote
ESOP
2010
Springer
15 years 9 months 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 ...
TACAS
2010
Springer
15 years 6 months ago
2010
Springer
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
124
click to vote
FOSSACS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
165
click to vote
POPL
2005
ACM
15 years 12 months ago
2005
ACM
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...