1716 search results - page 33 / 344 » Proving Conditional Termination |
124
Voted
AAECC
2005
Springer
15 years 2 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
112
Voted
FMCO
2007
Springer
15 years 8 months ago
2007
Springer
This paper describes the architecture of costa, an abstract interpretation based cost and termination analyzer for Java bytecode. The system receives as input a bytecode program, (...
115
click to vote
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...
119
click to vote
CAV
2006
Springer
15 years 6 months ago
2006
Springer
Previous symbolic software model checkers (i.e., program analysis tools based on predicate abstraction, pushdown model checkiterative counterexample-guided abstraction refinement, ...
116
click to vote
ENTCS
2008
15 years 2 months ago
2008
Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to ...