423 search results - page 19 / 85 » On Term Rewriting Systems Having a Rational Derivation |
110
click to vote
PEPM
2010
ACM
14 years 11 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...
104
click to vote
PLDI
2006
ACM
15 years 3 months ago
2006
ACM
Constructing correct concurrent garbage collection algorithms is notoriously hard. Numerous such algorithms have been proposed, implemented, and deployed – and yet the relations...
ENTCS
2008
14 years 9 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...
84
Voted
RTA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper is a contribution to the long standing open problem of uniform termination of Semi-Thue Systems that consist of one rule s → t. McNaughton previously showed ...
CADE
2010
Springer
14 years 8 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...