11th International Workshop on Rewriting Logic and its Applications
AN ETAPS 2016 2-DAYS SATELLITE EVENT
Eindhoven, The Netherlands, Saturday April 2 and Sunday April 3, 2016
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 succesful 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 2016 edition of WRLA will mark its 20th anniversary since its first edition in Asilomar, California, in 1996.
The topics of the workshop include, but are not limited to:
B. Rewriting as a Logical and Semantic Framework
C. Rewriting Languages
D. Verification Techniques
The final program of the workshop will include regular papers, tool papers, and work-in-progress presentations. The program will also contain invited talks, 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, emphasise the design and implementation, and give a clear account of the tool's functionality. The described tools must be publicly 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 at
Regular and work-in-progress papers should not exceed 15 pages including references. Tool papers can have a maximum of 6 pages including references and may have an appendix of up to 4 additional pages with usage details and tool demonstration.
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, the 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.
Location: Room CZ 5 Auditorium (building n.1 in this map)
The preproceedings as single pdf file.
The program of the workshop as a pdf file.
Nikolaj Bjorner. All strings attached: string and sequence constraints in Z3. Abstract
Helene Kirchner. Labeled Graphs Rewriting Meets with Social Networks. Abstract.
Salvador Lucas. Program termination: from well-founded orderings to logical models and back. Abstract
Grigore Rosu, Andrei Stefanescu, and Stefan Ciobaca. Program Verification using Reachability Logic. Abstract
Carolyn Talcott. Pathway Logic: Executable Models of Cellular Processes Abstract
Yuri Gil Dantas, Marcilio O. O. Lemos, Iguatemi E. Fonseca and Vivek Nigam. Formal Specification and Verification of a Selective Defense for TDoS Attacks
Óscar Martín, Alberto Verdejo and Narciso Martí-Oliet. Egalitarian state-transition systems
Yohan Boichut, Vivien Pelletier and Pierre Rety. Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems
Shiji Bijo, Einar Broch Johnsen, Ka I Pun and Silvia Lizeth Tapia Tarifa. A Maude Framework for Cache Coherent Multicore Architectures
Vlad Rusu and Andrei Arusoaie. Proving Reachability-Logic Formulas Incrementally
Antonio Moreno-Delgado, Francisco Durán and Jose Meseguer. Towards Generic Monitors for Object-Oriented Real-Time Maude Specifications
Traian Florin Serbanuta. Maximally Parallel Contextual String Rewriting
Stephen Skeirik and José Meseguer. Metalevel Algorithms For Variant Satisfiability
Please use the ETAPS registration web page
to register for WRLA 2016.
The deadline for early registration in ETAPS 2016 is March 1st, 2016. Do not miss it!
|1996||Asilomar (USA)||ENTCS 4||Theoretical Computer Science
Volume 285, Issue 2
|1998||Pont-a-Mousson (France)||ENTCS 15|
|2000||Kanazawa (Japan)||ENTCS 36|
|2002||Pisa (Italy)||ENTCS 71|
|2004||Barcelona (Spain)||ENTCS 117||Higher-Order and Symbolic Computation
Volume 20, Issue 1-2
|2006||Vienna (Austria)||ENTCS 176|
|2008||Budapest (Hungary)||ENTCS 238|
|2010||Paphos (Cyprus)||LNCS 6381||Journal of Logic and Algebraic Programming
Volume 81, Issues 7–8
|2012||Tallinn (Estonia)||LNCS 7571||Science of Computer Programming
|2014||Grenoble (France)||LNCS 8663||Journal of Logical and Algebraic Methods in Programming, Volume 85, Number 1, Part 1, January 2016|
For more information, please contact the organizers:
Dorel Lucanu , email: dorel.lucanu AT gmail.com