142 search results - page 9 / 29 » Proving Termination by Invariance Relations |
CADE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We prove several results related to local proofs, interpolation and suion calculus and discuss their use in predicate abstraction and invariant generation. Our proofs and...
EJC
2007
14 years 10 months ago
2007
We prove a conjecture of F. Chapoton relating certain enumerative invariants of (a) the cluster complex associated by S. Fomin and A. Zelevinsky with a finite root system and (b)...
173
click to vote
POPL
2008
ACM
15 years 10 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...
178
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
Asynchronous or "event-driven" programming is a popular technique to efficiently and flexibly manage concurrent interactions. In these programs, the programmer can post ...
AAECC
2008
Springer
14 years 10 months ago
2008
Springer
We consider unary term rewriting, i.e., term rewriting with unary signatures where all function symbols are either unary or constants. Terms over such signatures can be transformed...