444 search results - page 27 / 89 » Termination by Abstraction |
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. We describe a simple, conceptual forward analysis procedure for complete WSTS S. This computes the clover of a state s0, i.e., a finite description of the closure of the ...
FROCOS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...
LPAR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We present a novel way for reasoning about (possibly ir)rational quantifier-free non-linear arithmetic by a reduction to SAT/SMT. The approach is incomplete and dedicated...
ICTAC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In higher-order process calculi the values exchanged in communications may contain processes. There are only two capabilities for received processes: execution and forwar...