37 search results - page 2 / 8 » Automatic Termination Proofs for Programs with Shape-Shiftin... |
POPL
2008
ACM
14 years 5 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
ITP
2010
13 years 7 months ago
2010
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
LISP
2008
13 years 5 months ago
2008
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
ICTAC
2004
Springer
13 years 10 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
VMCAI
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...