Robert Nieuwenhuis
Proceedings of the 14th International Conference on Rewriting Techniques and Applications
RTA, 2003.

@proceedings{RTA-2003,
	address       = "Valencia, Spain",
	editor        = "Robert Nieuwenhuis",
	isbn          = "3-540-40254-3",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 14th International Conference on Rewriting Techniques and Applications}",
	volume        = 2706,
	year          = 2003,
}

Contents (35 items)

4 ×#logic
4 ×#term rewriting
4 ×#termination
2 ×#algorithm
2 ×#automaton
2 ×#decidability
2 ×#equation
2 ×#higher-order
2 ×#induction
2 ×#protocol

RTA-2003-Lincoln #biology

Invited Talk: Symbolic Systems Biology (PL), p. 1.

RTA-2003-Dowek #confluence

Confluence as a Cut Elimination Property (GD), pp. 2–13.

RTA-2003-Eker #commutative #scalability

Associative-Commutative Rewriting on Large Terms (SE), pp. 14–29.

RTA-2003-BournezCCKI #approach #automation #generative #rule-based

A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms (OB, GMC, VC, HK, LI), pp. 30–45.

RTA-2003-SinotFM #performance #reduction #string

Efficient Reductions with Director Strings (FRS, MF, IM), pp. 46–60.

RTA-2003-BournezH #logic

Rewriting Logic and Probabilities (OB, MH), pp. 61–75.

RTA-2003-ClavelDELMMT #maude

The Maude 2.0 System (MC, FD, SE, PL, NMO, JM, CLT), pp. 76–87.

RTA-2003-WellsPK #diagrams

Diagrams for Meaning Preservation (JBW, DP, FK), pp. 88–106.

RTA-2003-ForestK #reduction

Expression Reduction Systems with Patterns (JF, DK), pp. 107–122.

RTA-2003-Bruggink #higher-order

Residuals in Higher-Order Rewriting (HJSB), pp. 123–137.

RTA-2003-GraniczZH

Rewriting UNITY (AG, DMZ, JH), pp. 138–147.

RTA-2003-Comon-LundhC #decidability #encryption #first-order #logic #protocol

New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols (HCL, VC), pp. 148–164.

RTA-2003-KapurNW #algorithm #composition #protocol

An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation (DK, PN, LW), pp. 165–179.

RTA-2003-Verma #automaton #decidability #equation

Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties (KNV), pp. 180–196.

RTA-2003-ChenRV #analysis #rule-based #safety

Rule-Based Analysis of Dimensional Safety (FC, GR, RPV), pp. 197–207.

RTA-2003-Giavitto #modelling #simulation

Invited Talk: Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems (JLG), pp. 208–233.

RTA-2003-SalvatiG #complexity #higher-order #linear #on the #λ-calculus

On the Complexity of Higher-Order Matching in the Linear λ-Calculus (SS, PdG), pp. 234–245.

RTA-2003-Dal-ZilioL #automaton #logic #xml

XML Schema, Tree Logic and Sheaves Automata (SDZ, DL), pp. 246–263.

RTA-2003-ThiemannG #term rewriting #termination

Size-Change Termination for Term Rewriting (RT, JG), pp. 264–278.

RTA-2003-BorrallerasR #order #semantics

Monotonic AC-Compatible Semantic Path Orderings (CB, AR), pp. 279–295.

RTA-2003-MoserW

Relating Derivation Lengths with the Slow-Growing Hierarchy Directly (GM, AW), pp. 296–310.

RTA-2003-HirokawaM #termination

Tsukuba Termination Tool (NH, AM), pp. 311–320.

RTA-2003-GieslZ #liveness

Liveness in Rewriting (JG, HZ), pp. 321–336.

RTA-2003-BartheS #framework #induction #platform #validation

Validation of the JavaCard Platform with Implicit Induction Techniques (GB, SS), pp. 337–351.

RTA-2003-UrsoK #induction

“Term Partition” for Mathematical Induction (PU, EK), pp. 352–366.

RTA-2003-Kutsia #equation #proving

Equational Prover of THEOREMA (TK), pp. 367–379.

RTA-2003-AotoY #term rewriting #termination

Termination of Simply Typed Term Rewriting by Translation and Labelling (TA, TY), pp. 380–394.

RTA-2003-Blanqui #deduction

Rewriting Modulo in Deduction Modulo (FB), pp. 395–409.

RTA-2003-Geser #string #termination

Termination of String Rewriting Rules That Have One Pair of Overlaps (AG), pp. 410–423.

RTA-2003-BrandMV #exclamation #for free #term rewriting

Environments for Term Rewriting Engines for Free! (MvdB, PEM, JJV), pp. 424–435.

RTA-2003-McAllester #algorithm #logic #ml #type inference

Joint RTA-TLCA Invited Talk: A Logical Algorithm for ML Type Inference (DAM), pp. 436–451.

RTA-2003-GhaniH

A Rewriting Alternative to Reidemeister-Schreier (NG, AH), pp. 452–466.

RTA-2003-KhasidashviliG #partial order #semantics #term rewriting

Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication) (ZK, JRWG), pp. 467–482.

RTA-2003-OhsakiST

Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism (HO, HS, TT), pp. 483–498.

RTA-2003-RouV #incremental #regular expression #testing

Testing Extended Regular Language Membership Incrementally by Rewriting (GR, MV), pp. 499–514.