37 search results - page 6 / 8 » Automatic Termination Proofs for Programs with Shape-Shiftin... |
RTA
2007
Springer
15 years 5 months ago
2007
Springer
The third Termination Competition took place in June 2006. We present the background, results and conclusions of this competition. 1 Motivation and history In the past decades seve...
208
click to vote
POPL
2009
ACM
16 years 6 days ago
2009
ACM
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
106
click to vote
CADE
2010
Springer
15 years 20 days ago
2010
Springer
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
169
click to vote
POPL
2009
ACM
16 years 6 days ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
LPAR
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...