Franz Baader
Proceedings of the 18th International Conference on Term Rewriting and Applications
RTA, 2007.

@proceedings{RTA-2007,
	address       = "Paris, France",
	editor        = "Franz Baader",
	isbn          = "978-3-540-73447-5",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 18th International Conference on Term Rewriting and Applications}",
	volume        = 4533,
	year          = 2007,
}

Contents (30 items)

4 ×#termination
3 ×#calculus
3 ×#confluence
3 ×#on the
3 ×#proving
3 ×#term rewriting
2 ×#logic
2 ×#named
2 ×#prototype
2 ×#using

RTA-2007-Leroy #compilation #optimisation #verification

Formal Verification of an Optimizing Compiler (XL), p. 1.

RTA-2007-NieuwenhuisORR #challenge #modulo theories #satisfiability

Challenges in Satisfiability Modulo Theories (RN, AO, ERC, AR), pp. 2–18.

RTA-2007-Pfenning #logic #on the

On a Logical Foundation for Explicit Substitutions (FP), p. 19.

RTA-2007-AnantharamanNR

Intruders with Caps (SA, PN, MR), pp. 20–35.

RTA-2007-BallandBKMR #java #named

Tom: Piggybacking Rewriting on Java (EB, PB, RK, PEM, AR), pp. 36–47.

RTA-2007-BoichutGJR #approximate #performance #prototype

Rewriting Approximations for Fast Prototyping of Static Analyzers (YB, TG, TPJ, LLR), pp. 48–62.

RTA-2007-TourE

Determining Unify-Stable Presentations (TBdlT, ME), pp. 63–77.

RTA-2007-CirsteaF #calculus #confluence

Confluence of Pattern-Based Calculi (HC, GF), pp. 78–92.

RTA-2007-DowekH #proving

A Simple Proof That Super-Consistency Implies Cut Elimination (GD, OH), pp. 93–106.

RTA-2007-DurandS #bottom-up

Bottom-Up Rewriting Is Inverse Recognizability Preserving (ID, GS), pp. 107–121.

RTA-2007-DuvalEP #garbage collection #graph grammar

Adjunction for Garbage Collection with Application to Graph Rewriting (DD, RE, FP), pp. 122–136.

RTA-2007-EchahedP #confluence #pointer #strict #term rewriting

Non Strict Confluent Rewrite Systems for Data-Structures with Pointers (RE, NP), pp. 137–152.

RTA-2007-EscobarM #infinity #model checking #using

Symbolic Model Checking of Infinite-State Systems Using Narrowing (SE, JM), pp. 153–168.

RTA-2007-Santo

Delayed Substitutions (JES), pp. 169–183.

RTA-2007-GodoyH #decidability #term rewriting

Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems (GG, EH), pp. 184–199.

RTA-2007-GodoyHT #termination

Termination of Rewriting with Right-Flat Rules (GG, EH, AT), pp. 200–213.

RTA-2007-HaemmerleF #confluence

Abstract Critical Pairs and Confluence of Arbitrary Binary Relations (RH, FF), pp. 214–228.

RTA-2007-HendrixM #on the #order #specification

On the Completeness of Context-Sensitive Order-Sorted Specifications (JH, JM), pp. 229–245.

RTA-2007-HillsR #analysis #logic #named #prototype

KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis (MH, GR), pp. 246–256.

RTA-2007-Kikuchi #calculus #normalisation #proving

Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi (KK), pp. 257–272.

RTA-2007-KorpM #bound #proving #term rewriting #termination #using

Proving Termination of Rewrite Systems Using Bounds (MK, AM), pp. 273–287.

RTA-2007-KutsiaLV #sequence #unification

Sequence Unification Through Currying (TK, JL, MV), pp. 288–302.

RTA-2007-MarcheZ #contest #termination

The Termination Competition (CM, HZ), pp. 303–313.

RTA-2007-Oostrom #random

Random Descent (VvO), pp. 314–328.

RTA-2007-Schmidt-Schauss #calculus #correctness

Correctness of Copy in Calculi with Letrec (MSS), pp. 329–343.

RTA-2007-Strassburger

A Characterization of Medial as Rewriting Rule (LS), pp. 344–358.

RTA-2007-Tatsuta #λ-calculus #μ-calculus

The Maximum Length of μ-Reduction in λμ-Calculus (MT), pp. 359–373.

RTA-2007-Vaux #linear #on the

On Linear Combinations of λ-Terms (LV), pp. 374–388.

RTA-2007-ZanklM #constraints

Satisfying KBO Constraints (HZ, AM), pp. 389–403.

RTA-2007-ZantemaW #termination

Termination by Quasi-periodic Interpretations (HZ, JW), pp. 404–418.