203 search results - page 9 / 41 » Datatype-Generic Termination Proofs |
223
click to vote
POPL
2008
ACM
16 years 2 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...
108
Voted
CADE
2001
Springer
16 years 2 months ago
2001
Springer
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
152
Voted
TACAS
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
168
click to vote
LPAR
2004
Springer
15 years 7 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
125
click to vote
PLDI
2006
ACM
15 years 7 months ago
2006
ACM
Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and conte...