1147 search results - page 36 / 230 » Termination in language-based systems |
RTA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
VMCAI
2005
Springer
14 years 2 months ago
2005
Springer
We present a technique to prove termination of multipath polynomial programs, an expressive class of loops that enables practical traction and analysis. The technique is based on ï...
PPL
2007
13 years 8 months ago
2007
In this paper, we present an program that enables the transformation of a nonterminating alternator into a terminating alternator. Our solution is stabilization preserving and has...
FMCO
2007
Springer
14 years 2 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, (...
ENTCS
2008
13 years 8 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...