861 search results - page 11 / 173 » Symbolic Program Analysis Using Term Rewriting and Generaliz... |
124
click to vote
PEPM
2010
ACM
15 years 1 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
107
click to vote
PPDP
2007
Springer
15 years 5 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
107
click to vote
RTA
2007
Springer
15 years 5 months ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
ICTAC
2004
Springer
15 years 5 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
IFIP
2004
Springer
15 years 5 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...