Workshop Description

Rewriting is a natural model of computation and an expressive semantic framework for concurrency, parallelism, communication, and interaction. It can be used for specifying a wide range of systems and languages in various application domains. It also has good properties as a metalogical framework for representing logics. Several successful languages based on rewriting (ASF+SDF, CafeOBJ, ELAN, Maude) have been designed and implemented. The aim of WRLA is to bring together researchers with a common interest in rewriting and its applications, and to give them the opportunity to present their recent work, discuss future research directions, and exchange ideas.

The topics of the workshop include, but are not limited to:
  1. Foundations
    • foundations and models of rewriting and rewriting logic, including termination, confluence, coherence, and complexity
    • unification, generalization, narrowing, and partial evaluation
    • constrained rewriting and symbolic algebra
    • graph rewriting
    • tree automata
    • rewriting strategies
    • rewriting-based calculi and explicit substitutions
  2. Rewriting as a Logical and Semantic Framework
    • uses of rewriting and rewriting logic as a logical framework, including deduction modulo
    • uses of rewriting as a semantic framework for programming language semantics
    • rewriting semantics of concurrency models, distributed systems, and network protocols
    • rewriting semantics of real-time, hybrid, and probabilistic systems
    • uses of rewriting for compilation and language transformation
  3. Rewriting Languages
    • rewriting-based declarative languages
    • type systems for rewriting
    • implementation techniques
    • tools supporting rewriting languages
  4. Verification Techniques
    • verification of confluence, termination, coherence, sufficient completeness, and related properties
    • temporal, modal, and reachability logics for verifying dynamic properties of rewrite theories
    • explicit-state and symbolic model checking techniques for verification of rewrite theories
    • rewriting-based theorem proving, including (co)inductive theorem proving
    • rewriting-based constraint solving and satisfiability
    • rewriting-semantics-based verification and analysis of programs
  5. Applications
    • applications in logic, mathematics, physics, and biology
    • rewriting models of biology, chemistry, and membrane systems
    • security specification and verification
    • applications to distributed, network, mobile, and cloud computing
    • specification and verification of real-time, hybrid, probabilistic, and cyber-physical systems
    • specification and verification of critical systems
    • applications to model-based software engineering
    • applications to engineering and planning.

Important Dates

  • Paper submission deadline:
  • January 12th, 2020
  • Author notification:
  • February 10th, 2020
  • Final version:
  • March 1st, 2020

    Call For Papers

    Available here.

    Submission

    The program of the workshop will include regular papers, tool papers, and work-in-progress presentations. The program will also contain invited papers, and tutorials to be determined by the program committee.

    Regular papers must contain original contributions, be clearly written, include appropriate references, and comparison with related work. They must be unpublished and not submitted simultaneously for publication elsewhere.

    Tool papers have to present a new tool, a new tool component, or novel extensions to an existing tool. They should provide a short description of the theoretical foundations with relevant citations, emphasize the design and implementation, and give a clear account of the tool's functionality. The described tools must be available via the web.

    Work-in-progress papers present early-stage work or other types of innovative or thought-provoking work related to the topics of the workshop. The difference between work-in-progress and regular papers is that work-in-progress submissions represent work that has not reached yet a level of completion that would warrant the full refereed selection process. We encourage researchers and practitioners to submit work-in- progress papers as this provides a unique opportunity for sharing valuable ideas, eliciting useful feedback on ongoing work, and fostering discussions and collaborations among colleagues.

    All submissions should be formatted according to the guidelines for Springer LNCS papers, and should be submitted electronically using EasyChair. Papers should be submitted electronically as a PDF file via the EasyChair system.

    Regular and work-in-progress papers should not exceed 15 pages including references. Tool papers should not exceed 6 pages including references and may have an appendix of up to 4 additional pages with usage details and tool demonstration.

    Publication

    All submissions will be evaluated by the program committee. Regular papers, tool papers, and work-in-progress papers that are accepted will be presented at the workshop and included in the pre-proceedings, which will be available during the workshop. Following the tradition of the last editions, regular papers, tool papers, and invited presentations will be published as a volume in Springer's Lecture Notes in Computer Science (LNCS) series to be distributed after the workshop.

    A special issue of JLAMP, the Journal of Logical and Algebraic Methods in Programming, is approved for extended versions of selected papers from WRLA 2020.

    Best Paper Award

    The program committee will consider a best paper award (a diploma and 500 €) for a paper in which at least one author is a junior researcher (a PhD student or the PhD defense was less than two years ago). The PC chairs may require the other authors to declare that at least 50% of the contribution was made by the junior researcher.

    Program Committee

    • Erika Abraham - RWTH Aachen, Germany
    • María Alpuente - Universitat Politècnica de València, Spain
    • Irina Mariuca Asavoae - Trusted Labs, France
    • Kyungmin Bae - Pohang University of Science and Technology, Korea
    • Clara Bertolissi - Aix-Marseille University, France
    • Artur Boronat - University of Leicester, United Kingdom
    • Roberto Bruni - Università di Pisa, Italy
    • Francisco Durán - Universidad de Málaga, Spain
    • Santiago Escobar - Universitat Politècnica de València, Spain (co-chair)
    • Maribel Fernández - King's College London, United Kingdom
    • Thomas Genet - Université de Rennes, France
    • Raúl Gutiérrez - Universitat Politècnica de València, Spain
    • Nao Hirokawa - JAIST, Japan
    • Alexander Knapp - University Augsburg, Germany
    • Alberto Lluch-Lafuente - Technical University of Denmark, Denmark
    • Dorel Lucanu - Alexandru Ioan Cuza University, Romania
    • Narciso Martí-Oliet - Universidad Complutense de Madrid, Spain (co-chair)
    • Aart Middeldorp - University of Innsbruck, Austria
    • José Meseguer - University of Illinois at Urbana-Champaign, USA
    • Cesar A. Muñoz - NASA Langley Research Center, USA
    • Vivek Nigam - Federal University of Paraíba, Brazil
    • Etienne Payet - University of La Reunion, France
    • Kazuhiro Ogata - JAIST, Japan
    • Adrián Riesco - Universidad Complutense de Madrid, Spain
    • Christophe Ringeissen - INRIA, France
    • Camilo Rocha - Pontificia Universidad Javeriana, Colombia
    • Grigore Rosu - University of Illinois at Urbana-Champaign, USA
    • Vlad Rusu - INRIA Lille, France
    • Ralf Sasse - ETH Zurich, Switzerland
    • Traian Serbanuta - University of Bucharest, Romania
    • Carolyn Talcott - SRI International, USA

    Steering Committee

    • Kokichi Futatsugi, JAIST, Japan
    • Claude Kirchner, INRIA Research Center Bordeaux - Sud-Ouest, France
    • Narciso Martí-Oliet, Universidad Complutense de Madrid, Spain
    • José Meseguer, University of Illinois at Urbana-Champaign, USA
    • Ugo Montanari, University of Pisa, Italy
    • Grigore Rosu, University of Illinois at Urbana-Champaign, USA
    • Carolyn Talcott, SRI International, USA
    • Martin Wirsing, Ludwig Maximilians Universität München, Germany