Advertisement

Rewriting Logic and Its Applications

11th International Workshop, WRLA 2016, Held as a Satellite Event of ETAPS, Eindhoven, The Netherlands, April 2-3, 2016, Revised Selected Papers

  • Dorel Lucanu
Conference proceedings WRLA 2016

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9942)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9942)

Table of contents

  1. Front Matter
    Pages I-XV
  2. Maribel Fernández, Hélène Kirchner, Bruno Pinaud, Jason Vallet
    Pages 1-25
  3. Shiji Bijo, Einar Broch Johnsen, Ka I Pun, Silvia Lizeth Tapia Tarifa
    Pages 47-63
  4. Yohan Boichut, Vivien Pelletier, Pierre Réty
    Pages 64-81
  5. Yuri Gil Dantas, Marcilio O. O. Lemos, Iguatemi E. Fonseca, Vivek Nigam
    Pages 82-97
  6. Óscar Martín, Alberto Verdejo, Narciso Martí-Oliet
    Pages 98-117
  7. Antonio Moreno-Delgado, Francisco Durán, José Meseguer
    Pages 118-133
  8. Vlad Rusu, Andrei Arusoaie
    Pages 134-151
  9. Traian Florin Şerbănuţă, Liviu P. Dinu
    Pages 152-166
  10. Stephen Skeirik, José Meseguer
    Pages 167-184
  11. Back Matter
    Pages 185-185

About these proceedings

Introduction

This book constitutes the thoroughly refereed post-workshop proceedings of the 11th International Workshop on Rewriting Logic and its Applications, WRLA 2016, held as a satellite event of ETAPS 2016, in Eindhoven, The Netherlands, in April 2016.

The 8 revised full papers presented together with 2 invited papers and 3 abstracts were carefully reviewed and selected from 14 submissions. The papers cover several topics such as: foundations; rewriting as a logical and semantic framework; rewriting languages; verification techniques; and applications.

Keywords

logical models model checking rewrite languages temporal logic tree automata and tree languages finite variant property (FVP) graph rewriting maude metalevel algorithms modular specification reachability logic rewriting logic rewriting logic rewriting models of biology rewriting semantics rewriting strategies rewriting based theorem proving rewriting based verification satisfiability in initial algebras state/transition structuresVoIP

Editors and affiliations

  • Dorel Lucanu
    • 1
  1. 1.Alexandru Ioan Cuza University IasiRomania

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-44802-2
  • Copyright Information Springer International Publishing Switzerland 2016
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-44801-5
  • Online ISBN 978-3-319-44802-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site