@InProceedings{Lincoln-RTA03, author={Lincoln, P.}, title={{Symbolic Systems Biology (invited lecture)}}, pages={1}, crossref={RTA03} } @InProceedings{Giavitto-RTA03, author={Giavitto, J.-L.}, title={{Topological Collections, Transformations and their Application to the Modelling and the Simulation of Dynamical Systems (invited lecture)}}, pages={208-233}, crossref={RTA03} } @InProceedings{McAllester-RTA03, author={McAllester, D.}, title={{A Logical Algorithm for ML Type Inference (invited lecture)}}, pages={436-451}, crossref={RTA03} } @InProceedings{Kutsia-RTA03, author={Kutsia, T.}, title={{The Equational Prover of THEOREMA (system description)}}, pages={367-379}, crossref={RTA03} } @InProceedings{HirokawaM-RTA03, author={Hirokawa, N. and Middeldorp, A.}, title={{Tsukuba Termination Tool (system description)}}, pages={311-320}, crossref={RTA03} } @InProceedings{ChenRV-RTA03, author={Chen, F. and Rosu, G. and Venkatesan, R. P.}, title={{Rule-based Analysis of Dimensional Safety (system description)}}, pages={197-207}, crossref={RTA03} } @InProceedings{vandenBrandMV-RTA03, author={van den Brand, M. G. J. and Moreau, P.-E. and Vinju, J. J.}, title={{Environments for Term Rewriting Engines for Free! (system description)}}, pages={424-435}, crossref={RTA03} } @InProceedings{GraniczZH-RTA03, author={Granicz, A. and Zimmerman, D. M. and Hickey, J.}, title={{Rewriting UNITY (system description)}}, pages={138-147}, crossref={RTA03} } @InProceedings{Maude-RTA03, author={Clavel, M. and Dur\'an, F. and Eker, S. and Lincoln, P. and Mart\'{\i}-Oliet, N. and Meseguer, J. and Talcott, C.}, title={{The Maude 2.0 System (system description)}}, pages={76-87}, crossref={RTA03} } @InProceedings{Dowek-RTA03, author={Dowek, G.}, title={{Confluence as a cut elimination property}}, pages={2-13}, crossref={RTA03} } @InProceedings{Eker-RTA03, author={Eker, S.}, title={{Associative-Commutative Rewriting on Large Terms}}, pages={14-29}, crossref={RTA03} } @InProceedings{BournezCCKI-RTA03, author={Bournez, O. and Come, G.-M. and Conraud, V. and Kirchner, H. and Ibanescu, L.}, title={{A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms}}, pages={30-45}, crossref={RTA03} } @InProceedings{SinotFM-RTA03, author={Sinot, F.-R. and Fern\'andez, M. and Mackie, I.}, title={{Efficient Reductions with Director Strings}}, pages={46-60}, crossref={RTA03} } @InProceedings{BournezH-RTA03, author={Bournez, O. and Hoyrup, M.}, title={{Rewriting Logic and Probabilities}}, pages={61-75}, crossref={RTA03} } @InProceedings{WellsPK-RTA03, author={Wells, J. B. and Plump, D. and Kamareddine, F.}, title={{Diagrams for Meaning Preservation}}, pages={88-106}, crossref={RTA03} } @InProceedings{ForestK-RTA03, author={Forest, J. and Kesner, D.}, title={{Expression Reduction Systems with Patterns}}, pages={107-122}, crossref={RTA03} } @InProceedings{SanderB-RTA03, author={Sander Bruggink, H. J.}, title={{Residuals in Higher-Order Rewriting}}, pages={123-137}, crossref={RTA03} } @InProceedings{ComonLC-RTA03, author={Comon-Lundh, H. and Cortier, V.}, title={{New decidability results for fragments of first order logic and application to cryptographic protocols}}, pages={148-164}, crossref={RTA03} } @InProceedings{KapurNW-RTA03, author={Kapur, D. and Narendran, P. and Wang, L.}, title={{An E-unification algorithm for analyzing protocols that use modular exponentiation}}, pages={165-179}, crossref={RTA03} } @InProceedings{Verma-RTA03, author={Verma, K. N.}, title={{Two-Way Equational Tree Automata for AC-like Theories: Decidability and Closure Properties}}, pages={180-196}, crossref={RTA03} } @InProceedings{SalvatidG-RTA03, author={Salvati, S. and de Groote, Ph.}, title={{On the complexity of higher-order matching in the linear lambda-calculus}}, pages={234-245}, crossref={RTA03} } @InProceedings{DalZilioL-RTA03, author={Dal Zilio, S. and Lugiez, D.}, title={{XML Schema, Tree Logic and Sheaves Automata}}, pages={246-263}, crossref={RTA03} } @InProceedings{ThiemannG-RTA03, author={Thiemann, R. and Giesl, J.}, title={{Size-Change Termination for Term Rewriting}}, pages={264-278}, crossref={RTA03} } @InProceedings{BorrallerasR-RTA03, author={Borralleras, C. and Rubio, A.}, title={{Monotonic AC-Compatible Semantic Path Orderings}}, pages={279-295}, crossref={RTA03} } @InProceedings{MoserW-RTA03, author={Moser, G. and Weiermann, A.}, title={{Relating derivation lengths with the slow-growing hierarchy directly}}, pages={296-310}, crossref={RTA03} } @InProceedings{GieslZ-RTA03, author={Giesl, J. and Zantema, H.}, title={{Liveness in Rewriting}}, pages={321-336}, crossref={RTA03} } @InProceedings{BartheS-RTA03, author={Barthe, G. and Stratulat, S.}, title={{Validation of the JavaCard Platform with Implicit Induction Techniques}}, pages={337-351}, crossref={RTA03} } @InProceedings{UrsoK-RTA03, author={Urso, P. and Kounalis, E.}, title={{"Term Partition" for Mathematical Induction}}, pages={352-366}, crossref={RTA03} } @InProceedings{AotoY-RTA03, author={Aoto, T. and Yamada, T.}, title={{Termination of Simply Typed Term Rewriting Systems by Translation and Labelling}}, pages={380-394}, crossref={RTA03} } @InProceedings{Blanqui-RTA03, author={Blanqui, F.}, title={{Rewriting Modulo in Deduction Modulo}}, pages={395-409}, crossref={RTA03} } @InProceedings{Geser-RTA03, author={Geser, A.}, title={{Termination of String Rewriting Rules That Have One Pair of Overlaps}}, pages={410-423}, crossref={RTA03} } @InProceedings{GhaniH-RTA03, author={Ghani, N. and Heyworth, A.}, title={{A Rewriting Alternative to Reidermeister-Schreier}}, pages={452-466}, crossref={RTA03} } @InProceedings{KhasidashviliG-RTA03, author={Khasidashvili, Z. and Glauert, J.}, title={{Stable Computational Semantics of Conflict-free Rewrite Systems (Partial Orders with Duplication)}}, pages={467-482}, crossref={RTA03} } @InProceedings{OhsakiST-RTA03, author={Ohsaki, H. and Seki, H. and Takai, T.}, title={{Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism}}, pages={483-498}, crossref={RTA03} } @InProceedings{RosuV-RTA03, author={Rosu, G. and Viswanathan, M.}, title={{Testing Extended Regular Language Membership Incrementally by Rewriting}}, pages={499-514}, crossref={RTA03} } % CROSSREFERENCES % These must remain at the end of this file. @Proceedings{RTA03, year={2003}, month=jun # {~9--11,}, editor={Nieuwenhuis, R.}, title={{Rewriting Techniques and Applications, 14th International Conference, RTA-03}}, booktitle={{Rewriting Techniques and Applications, 14th International Conference, RTA-03}}, address={Valencia, Spain}, series={LNCS 2706}, publisher={Springer} }