Conferences in DBLP
Patrick Lincoln Invited Talk: Symbolic Systems Biology. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:1- [Conf ] Gilles Dowek Confluence as a Cut Elimination Property. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:2-13 [Conf ] Steven Eker Associative-Commutative Rewriting on Large Terms. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:14-29 [Conf ] Olivier Bournez , Guy-Marie Côme , Valérie Conraud , Hélène Kirchner , Liliana Ibanescu A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:30-45 [Conf ] François-Régis Sinot , Maribel Fernández , Ian Mackie Efficient Reductions with Director Strings. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:46-60 [Conf ] Olivier Bournez , Mathieu Hoyrup Rewriting Logic and Probabilities. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:61-75 [Conf ] Manuel Clavel , Francisco Durán , Steven Eker , Patrick Lincoln , Narciso Martí-Oliet , José Meseguer , Carolyn L. Talcott The Maude 2.0 System. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:76-87 [Conf ] J. B. Wells , Detlef Plump , Fairouz Kamareddine Diagrams for Meaning Preservation. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:88-106 [Conf ] Julien Forest , Delia Kesner Expression Reduction Systems with Patterns. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:107-122 [Conf ] Harrie Jan Sander Bruggink Residuals in Higher-Order Rewriting. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:123-137 [Conf ] Adam Granicz , Daniel M. Zimmerman , Jason Hickey Rewriting UNITY. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:138-147 [Conf ] Hubert Comon-Lundh , Véronique Cortier New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:148-164 [Conf ] Deepak Kapur , Paliath Narendran , Lida Wang An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:165-179 [Conf ] Kumar Neeraj Verma Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:180-196 [Conf ] Feng Chen , Grigore Rosu , Ram Prasad Venkatesan Rule-Based Analysis of Dimensional Safety. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:197-207 [Conf ] Jean-Louis Giavitto Invited Talk: Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:208-233 [Conf ] Sylvain Salvati , Philippe de Groote On the Complexity of Higher-Order Matching in the Linear lambda-Calculus. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:234-245 [Conf ] Silvano Dal-Zilio , Denis Lugiez XML Schema, Tree Logic and Sheaves Automata. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:246-263 [Conf ] René Thiemann , Jürgen Giesl Size-Change Termination for Term Rewriting. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:264-278 [Conf ] Cristina Borralleras , Albert Rubio Monotonic AC-Compatible Semantic Path Orderings. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:279-295 [Conf ] Georg Moser , Andreas Weiermann Relating Derivation Lengths with the Slow-Growing Hierarchy Directly. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:296-310 [Conf ] Nao Hirokawa , Aart Middeldorp Tsukuba Termination Tool. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:311-320 [Conf ] Jürgen Giesl , Hans Zantema Liveness in Rewriting. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:321-336 [Conf ] Gilles Barthe , Sorin Stratulat Validation of the JavaCard Platform with Implicit Induction Techniques. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:337-351 [Conf ] Pascal Urso , Emmanuel Kounalis "Term Partition" for Mathematical Induction. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:352-366 [Conf ] Temur Kutsia Equational Prover of THEOREMA. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:367-379 [Conf ] Takahito Aoto , Toshiyuki Yamada Termination of Simply Typed Term Rewriting by Translation and Labelling. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:380-394 [Conf ] Frédéric Blanqui Rewriting Modulo in Deduction Modulo. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:395-409 [Conf ] Alfons Geser Termination of String Rewriting Rules That Have One Pair of Overlaps. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:410-423 [Conf ] Mark van den Brand , Pierre-Etienne Moreau , Jurgen J. Vinju Environments for Term Rewriting Engines for Free! [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:424-435 [Conf ] David A. McAllester Joint RTA-TLCA Invited Talk: A Logical Algorithm for ML Type Inference. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:436-451 [Conf ] Neil Ghani , Anne Heyworth A Rewriting Alternative to Reidemeister-Schreier. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:452-466 [Conf ] Zurab Khasidashvili , John J. Glauert Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication). [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:467-482 [Conf ] Hitoshi Ohsaki , Hiroyuki Seki , Toshinori Takai Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:483-498 [Conf ] Grigore Rosu , Mahesh Viswanathan Testing Extended Regular Language Membership Incrementally by Rewriting. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:499-514 [Conf ]