Titlebook: Rewriting Techniques and Applications; 14th International C Robert Nieuwenhuis Conference proceedings 2003 Springer-Verlag Berlin Heidelber

Pessary

CHYME

Size-Change Termination for Term Rewritingnermost termination of arbitrary term rewrite systems (TRSs). Moreover, we compare this approach with existing techniques for termination analysis of TRSs (such as recursive path orderings or dependency pairs). It turns out that the size-change principle on its own fails for many examples that can b

lethargy

Associative-Commutative Rewriting on Large Termsues for converting to and from a more conventional representation together with a heuristic for deciding at runtime when to convert a term to the new representation. We sketch how our approach can be generalized to order-sorted AC rewriting and to other equational theories. We also present some experimental results using the Maude 2 interpreter.

遺忘

Constant

Residuals in Higher-Order Rewritingrove that an orthogonal PRS together with the residual operator mentioned above, is a residual system. As a side-effect, all results of (abstract)residual theory are inherited by orthogonal PRSs, such as confluence, and the notion of permutation equivalence of reductions.

miniature

New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protoco formalization is an approximation of the set of possible traces, for instance relaxing the nonce freshness assumption. As a consequence, we get some new decidability results for the verification of cryptographic protocols with exclusive or.

finite

暫時(shí)過(guò)來(lái)

Efficient Reductions with Director Stringsus offering more sharing). Our experimental results confirm that, for large combinator based terms, our weak evaluation strategies out-perform standard evaluators. Moreover, we derive two abstract machines for strong reduction which inherit the efficiency of the weak evaluators.

政府

Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Propertieslled push clauses. (The . case is open.) In particular, the two-way automata modulo these theories are closed under union and intersection, and emptiness is decidable. We also note that alternating variants have undecidable emptiness problem for most theories, contrarily to the non-equational case where alternation is essentially harmless.

機(jī)械

Size-Change Termination for Term Rewritingfit from their respective advantages, we show how to combine the size-change principle with classical orderings and with dependency pairs. In this way, we obtain a new approach for automated termination proofs of TRSs which is more powerful than previous approaches.