×

Term rewriting and applications. 18th international conference, RTA 2007, Paris, France, June 26–28, 2007. Proceedings. (English) Zbl 1121.68001

Lecture Notes in Computer Science 4533. Berlin: Springer (ISBN 978-3-540-73447-5/pbk). xii, 419 p. (2007).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1113.68009).
Indexed articles:
Nieuwenhuis, Robert; Oliveras, Albert; Rodríguez-Carbonell, Enric; Rubio, Albert, Challenges in satisfiability modulo theories, 2-18 [Zbl 1203.68189]
Anantharaman, Siva; Narendran, Paliath; Rusinowitch, Michael, Intruders with caps, 20-35 [Zbl 1203.94091]
Boichut, Yohan; Genet, Thomas; Jensen, Thomas; Le Roux, Luka, Rewriting approximations for fast prototyping of static analyzers, 48-62 [Zbl 1203.68068]
Boy de la Tour, Thierry; Echenim, Mnacho, Determining unify-stable presentations, 63-77 [Zbl 1203.03019]
Cirstea, Horatiu; Faure, Germain, Confluence of pattern-based calculi, 78-92 [Zbl 1203.68069]
Dowek, Gilles; Hermant, Olivier, A simple proof that super-consistency implies cut elimination, 93-106 [Zbl 1203.03086]
Durand, Irène; Sénizergues, Géraud, Bottom-up rewriting is inverse recognizability preserving, 107-121 [Zbl 1203.68070]
Duval, Dominique; Echahed, Rachid; Prost, Frederic, Adjunction for garbage collection with application to graph rewriting, 122-136 [Zbl 1203.68071]
Echahed, Rachid; Peltier, Nicolas, Non strict confluent rewrite systems for data-structures with pointers, 137-152 [Zbl 1203.68072]
Escobar, Santiago; Meseguer, José, Symbolic model checking of infinite-state systems using narrowing, 153-168 [Zbl 1203.68097]
Espírito Santo, José, Delayed substitutions, 169-183 [Zbl 1203.68031]
Godoy, Guillem; Huntingford, Eduard, Innermost-reachability and innermost-joinability are decidable for shallow term rewrite systems, 184-199 [Zbl 1203.68073]
Godoy, Guillem; Huntingford, Eduard; Tiwari, Ashish, Termination of rewriting with right-flat rules, 200-213 [Zbl 1203.68074]
Haemmerlé, Rémy; Fages, François, Abstract critical pairs and confluence of arbitrary binary relations, 214-228 [Zbl 1203.68075]
Hendrix, Joe; Meseguer, José, On the completeness of context-sensitive order-sorted specifications, 229-245 [Zbl 1203.68098]
Kikuchi, Kentaro, Simple proofs of characterizing strong normalization for explicit substitution calculi, 257-272 [Zbl 1203.68076]
Korp, Martin; Middeldorp, Aart, Proving termination of rewrite systems using bounds, 273-287 [Zbl 1203.68077]
Kutsia, Temur; Levy, Jordi; Villaret, Mateu, Sequence unification through Currying, 288-302 [Zbl 1196.68111]
van Oostrom, Vincent, Random descent, 314-328 [Zbl 1203.68082]
Schmidt-Schauß, Manfred, Correctness of copy in calculi with letrec, 329-343 [Zbl 1203.68032]
Straßburger, Lutz, A characterization of medial as rewriting rule, 344-358 [Zbl 1203.68079]
Tatsuta, Makoto, The maximum length of mu-reduction in lambda mu-calculus, 359-373 [Zbl 1203.68033]
Vaux, Lionel, On linear combinations of \(\lambda \)-terms, 374-388 [Zbl 1203.03021]
Zankl, Harald; Middeldorp, Aart, Satisfying KBO constraints, 389-403 [Zbl 1203.68080]
Zantema, Hans; Waldmann, Johannes, Termination by quasi-periodic interpretations, 404-418 [Zbl 1203.68081]

MSC:

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Q42 Grammars and rewriting systems
00B25 Proceedings of conferences of miscellaneous specific interest

Citations:

Zbl 1113.68009
PDFBibTeX XMLCite
Full Text: DOI