101 search results - page 5 / 21 » Cyclic proofs of program termination in separation logic |
CADE
2001
Springer
15 years 10 months ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
APLAS
2005
ACM
15 years 3 months ago
2005
ACM
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
LOPSTR
2007
Springer
15 years 3 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
CONCUR
2004
Springer
15 years 3 months ago
2004
Springer
We present a trace semantics for a language of parallel programs which share access to mutable data. We introduce a resource-sensitive logic for partial correctness, based on a re...
109
click to vote
PEPM
2010
ACM
14 years 11 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...