Proceedings of the 20th International Conference on Rewriting Techniques and Applications
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Ralf Treinen
Proceedings of the 20th International Conference on Rewriting Techniques and Applications
RTA, 2009.

Full names Links ISxN
	address       = "Brasília, Brazil",
	doi           = "10.1007/978-3-642-02348-4",
	editor        = "Ralf Treinen",
	isbn          = "978-3-642-02347-7",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 20th International Conference on Rewriting Techniques and Applications}",
	volume        = 5595,
	year          = 2009,

Contents (27 items)

RTA-2009-Waldmann #automation #termination
Automatic Termination (JW), pp. 1–16.
Loops under Strategies (RT, CS), pp. 17–31.
RTA-2009-FuhsGPSF #integer #proving #term rewriting #termination
Proving Termination of Integer Term Rewriting (CF, JG, MP, PSK, SF), pp. 32–47.
RTA-2009-AvanziniM #dependence #order #polynomial
Dependency Pairs and Polynomial Path Orders (MA, GM), pp. 48–62.
RTA-2009-GodoyJ #normalisation
Unique Normalization for Shallow TRS (GG, FJ), pp. 63–77.
RTA-2009-Schubert #parallel
The Existential Fragment of the One-Step Parallel Rewriting Theory (AS), pp. 78–92.
RTA-2009-AotoYT #automation #confluence #proving #term rewriting
Proving Confluence of Term Rewriting Systems Automatically (TA, JY, YT), pp. 93–102.
RTA-2009-TiuG #analysis #proving
A Proof Theoretic Analysis of Intruder Theories (AT, RG), pp. 103–117.
RTA-2009-SeidlV #protocol
Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case (HS, KNV), pp. 118–132.
RTA-2009-BursucC #algebra #bound #protocol #security
Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions (SB, HCL), pp. 133–147.
RTA-2009-BaudetCD #named
YAPA: A Generic Tool for Computing Intruder Knowledge (MB, VC, SD), pp. 148–163.
RTA-2009-Zantema #termination
Well-Definedness of Streams by Termination (HZ), pp. 164–178.
RTA-2009-Kahrs #composition #convergence
Modularity of Convergence in Infinitary Rewriting (SK), pp. 179–193.
RTA-2009-DuvalEP #approach #category theory #graph transformation
A Heterogeneous Pushout Approach to Term-Graph Transformation (DD, RE, FP), pp. 194–208.
RTA-2009-Falco #framework #interactive
An Explicit Framework for Interaction Nets (MdF), pp. 209–223.
RTA-2009-KimuraT #calculus #induction
Dual Calculus with Inductive and Coinductive Types (DK, MT), pp. 224–238.
Comparing Böhm-Like Trees (JK), pp. 239–254.
RTA-2009-MoserS #complexity #dependence
The Derivational Complexity Induced by the Dependency Pair Method (GM, AS), pp. 255–269.
RTA-2009-EndrullisVW #termination
Local Termination (JE, RCdV, JW), pp. 270–284.
RTA-2009-SchernhammerG #composition #named #termination
VMTL — A Modular Termination Laboratory (FS, BG), pp. 285–294.
RTA-2009-KorpSZM #termination
Tyrolean Termination Tool 2 (MK, CS, HZ, AM), pp. 295–304.
From Outermost to Context-Sensitive Rewriting (JE, DH), pp. 305–319.
RTA-2009-Lopez-FraguasRS #semantics
A Fully Abstract Semantics for Constructor Systems (FJLF, JRH, JSH), pp. 320–334.
RTA-2009-Simonsen #term rewriting
The -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity) (JGS), pp. 335–349.
RTA-2009-BaaderM #logic #unification
Unification in the Description Logic EL (FB, BM), pp. 350–364.
RTA-2009-GasconGS #unification
Unification with Singleton Tree Grammars (AG, GG, MSS), pp. 365–379.
RTA-2009-ClavelDEELMMT #maude #unification
Unification and Narrowing in Maude 2.4 (MC, FD, SE, SE, PL, NMO, JM, CLT), pp. 380–390.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.