default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20th RTA 2009: Brasília, Brazil
- Ralf Treinen:
Rewriting Techniques and Applications, 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009, Proceedings. Lecture Notes in Computer Science 5595, Springer 2009, ISBN 978-3-642-02347-7 - Johannes Waldmann:
Automatic Termination. 1-16 - René Thiemann
, Christian Sternagel:
Loops under Strategies. 17-31 - Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke:
Proving Termination of Integer Term Rewriting. 32-47 - Martin Avanzini, Georg Moser:
Dependency Pairs and Polynomial Path Orders. 48-62 - Guillem Godoy, Florent Jacquemard:
Unique Normalization for Shallow TRS. 63-77 - Aleksy Schubert:
The Existential Fragment of the One-Step Parallel Rewriting Theory. 78-92 - Takahito Aoto, Junichi Yoshida, Yoshihito Toyama:
Proving Confluence of Term Rewriting Systems Automatically. 93-102 - Alwen Tiu, Rajeev Goré:
A Proof Theoretic Analysis of Intruder Theories. 103-117 - Helmut Seidl, Kumar Neeraj Verma:
Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case. 118-132 - Sergiu Bursuc, Hubert Comon-Lundh:
Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions. 133-147 - Mathieu Baudet, Véronique Cortier, Stéphanie Delaune:
YAPA: A Generic Tool for Computing Intruder Knowledge. 148-163 - Hans Zantema:
Well-Definedness of Streams by Termination. 164-178 - Stefan Kahrs:
Modularity of Convergence in Infinitary Rewriting. 179-193 - Dominique Duval, Rachid Echahed, Frédéric Prost:
A Heterogeneous Pushout Approach to Term-Graph Transformation. 194-208 - Marc de Falco:
An Explicit Framework for Interaction Nets. 209-223 - Daisuke Kimura, Makoto Tatsuta:
Dual Calculus with Inductive and Coinductive Types. 224-238 - Jeroen Ketema:
Comparing Böhm-Like Trees. 239-254 - Georg Moser, Andreas Schnabl:
The Derivational Complexity Induced by the Dependency Pair Method. 255-269 - Jörg Endrullis, Roel C. de Vrijer, Johannes Waldmann:
Local Termination. 270-284 - Felix Schernhammer, Bernhard Gramlich:
VMTL-A Modular Termination Laboratory. 285-294 - Martin Korp, Christian Sternagel, Harald Zankl, Aart Middeldorp:
Tyrolean Termination Tool 2. 295-304 - Jörg Endrullis, Dimitri Hendriks:
From Outermost to Context-Sensitive Rewriting. 305-319 - Francisco Javier López-Fraguas, Juan Rodríguez-Hortalá, Jaime Sánchez-Hernández:
A Fully Abstract Semantics for Constructor Systems. 320-334 - Jakob Grue Simonsen:
The -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity). 335-349 - Franz Baader, Barbara Morawska:
Unification in the Description Logic EL. 350-364 - Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß:
Unification with Singleton Tree Grammars. 365-379 - Manuel Clavel, Francisco Durán, Steven Eker, Santiago Escobar, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott:
Unification and Narrowing in Maude 2.4. 380-390
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-01 23:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
