288 search results - page 8 / 58 » Interactive Termination Proofs Using Termination Cores |
110
click to vote
ACL2
2006
ACM
15 years 3 months ago
2006
ACM
A verifying compiler is one that emits both object code and a proof of correspondence between object and source code.1 We report the use of ACL2 in building a verifying compiler f...
LATA
2009
Springer
15 years 4 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
LICS
1991
IEEE
15 years 28 days ago
1991
IEEE
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
IFIP
2004
Springer
15 years 2 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
108
Voted
FOSSACS
2004
Springer
15 years 2 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...