Verifying Reachability-Logic Properties on Rewriting-Logic Specifications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Verifying Reachability-Logic Properties on Rewriting-Logic Specifications


Rewriting Logic is a simply, flexible, and powerful framework for specifying and analysing concurrent systems. Reachability Logic is a recently introduced formalism, which is currently used for defining the operational semantics of programming languages and for stating properties about program executions. Reachability Logic has its roots in a wider-spectrum framework, namely, in Rewriting Logic Semantics. In this paper we show how Reachability Logic can be adapted for stating properties of transition systems described by Rewriting-Logic specifications. We propose a procedure for verifying Rewriting-Logic specifications against Reachability-Logic properties. We prove the soundness of the procedure and illustrate it by verifying a communication protocol specified in Maude.
Fichier principal
Vignette du fichier
festchrift.pdf (685.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01158941 , version 1 (02-06-2015)



Dorel Lucanu, Vlad Rusu, Andrei Arusoaie, David Nowak. Verifying Reachability-Logic Properties on Rewriting-Logic Specifications. Logic, Rewriting, and Concurrency - Festschrift Symposium in Honor of José Meseguer, Sep 2015, Urbana Champaign, United States. ⟨10.1007/978-3-319-23165-5_21⟩. ⟨hal-01158941⟩
237 View
294 Download



Gmail Facebook Twitter LinkedIn More