Sciweavers

217 search results - page 15 / 44
» Automatic Termination
Sort
View
FROCOS
2005
Springer
14 years 2 months ago
Proving Liveness with Fairness Using Rewriting
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 (...
Adam Koprowski, Hans Zantema
RTA
2010
Springer
14 years 14 days ago
Proving Productivity in Infinite Data Structures
For a general class of infinite data structures including streams, binary trees, and the combination of finite and infinite lists, we investigate a notion of productivity. This ...
Hans Zantema, Matthias Raffelsieper
BIRTHDAY
2010
Springer
13 years 8 months ago
Dynamic Rippling, Middle-Out Reasoning and Lemma Discovery
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...
Moa Johansson, Lucas Dixon, Alan Bundy
CAV
2006
Springer
133views Hardware» more  CAV 2006»
14 years 10 days ago
Programs with Lists Are Counter Automata
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Ra...
ICIP
2005
IEEE
14 years 10 months ago
Automatic adaptation of streaming multimedia content in a dynamic and distributed environment
The diversity of end-terminal and access network capabilities as well as the dynamic nature of wireless connections pose significant challenges to providers of multimedia streamin...
Andreas Hutter, Peter Amon, G. Panis, Eric Delfoss...