The SCEAS System
Navigation Menu

Conferences in DBLP

Rewriting Techniques and Applications (RTA) (rta)
2002 (conf/rta/2002)

  1. Natarajan Shankar, Harald Rueß
    Combining Shostak Theories. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:1-18 [Conf]
  2. John C. Mitchell
    Multiset Rewriting and Security Protocol Analysis. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:19-22 [Conf]
  3. Franz Baader
    Engineering of Logics for the Content-Based Representation of Information. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:23- [Conf]
  4. Paul-André Melliès
    Axiomatic Rewriting Theory VI Residual Theory Revisited. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:24-50 [Conf]
  5. Richard Kennaway, Zurab Khasidashvili, Adolfo Piperno
    Static Analysis of Modularity of beta-Reduction in the Hyperbalanced lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:51-65 [Conf]
  6. Germain Faure, Claude Kirchner
    Exceptions in the Rewriting Calculus. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:66-82 [Conf]
  7. Georg Struth
    Deriving Focused Lattice Calculi. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:83-97 [Conf]
  8. Hiroyuki Seki, Toshinori Takai, Youhei Fujinaka, Yuichi Kaji
    Layered Transducing Term Rewriting System and Its Recognizability Preserving Property. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:98-113 [Conf]
  9. Hitoshi Ohsaki, Toshinori Takai
    Decidability and Closure Properties of Equational Tree Languages. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:114-128 [Conf]
  10. Pierre Réty, Julie Vuotto
    Regular Sets of Descendants by Some Rewrite Strategies. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:129-143 [Conf]
  11. Johannes Waldmann
    Rewrite Games. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:144-158 [Conf]
  12. Paula Severi, Fer-Jan de Vries
    An Extensional Böhm Model. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:159-173 [Conf]
  13. Julien Forest
    A Weak Calculus with Explicit Operators for Pattern Matching and Substitution. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:174-191 [Conf]
  14. Chuck Liang, Gopalan Nadathur
    Tradeoffs in the Intensional Representation of Lambda Terms. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:192-206 [Conf]
  15. David Déharbe, Anamaria Martins Moreira, Christophe Ringeissen
    Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:207-221 [Conf]
  16. Janis Voigtländer
    Conditions for Efficiency Improvement by Tree Transducer Composition. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:222-236 [Conf]
  17. Martin Bravenboer, Eelco Visser
    Rewriting Strategies for Instruction Selection. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:237-251 [Conf]
  18. Olivier Bournez, Claude Kirchner
    Probabilistic Rewrite Strategies. Applications to ELAN. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:252-266 [Conf]
  19. Alfons Geser
    Loops of Superexponential Lengths in One-Rule String Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:267-280 [Conf]
  20. Elias Tahhan-Bittar
    Recursive Derivational Length Bounds for Confluent Term Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:281-295 [Conf]
  21. Salvador Lucas
    Termination of (Canonical) Context-Sensitive Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:296-310 [Conf]
  22. Witold Charatonik, Jean-Marc Talbot
    Atomic Set Constraints with Projection. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:311-325 [Conf]
  23. Jordi Levy, Mateu Villaret
    Currying Second-Order Unification Problems. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:326-339 [Conf]
  24. Daniel J. Dougherty, Tomasz Wierzbicki
    A Decidable Variant of Higher Order Matching. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:340-351 [Conf]
  25. Franz Baader, Cesare Tinelli
    Combining Decision Procedures for Positive Theories Sharing Constructors. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:352-366 [Conf]
  26. Jaco van de Pol
    JITty: A Rewriter with Strategy Annotations. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:367-370 [Conf]
  27. Irène Durand
    Autowrite: A Tool for Checking Properties of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:371-375 [Conf]
  28. Benoit Lecland, Pierre Réty
    TTSLI: An Implementation of Tree-Tuple Synchronized Languages. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:376-379 [Conf]
  29. Sylvain Lippi
    in2 : A Graphical Interpreter for Interaction Nets. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:380-386 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002