Sciweavers

12 search results - page 3 / 3
» Termination Analysis by Dependency Pairs and Inductive Theor...
Sort
View
PEPM
2010
ACM
14 years 21 days ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...
AISC
2008
Springer
14 years 23 days ago
Search Techniques for Rational Polynomial Orders
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto,...