29 search results - page 5 / 6 » Improved Modular Termination Proofs Using Dependency Pairs |
165
click to vote
FOSSACS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
129
click to vote
FROCOS
2007
Springer
15 years 10 months ago
2007
Springer
We introduce a propositional encoding of the recursive path order with status (RPO). RPO is a combination of a multiset path order and a lexicographic path order which considers pe...
125
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
130
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...
112
click to vote
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields a...