Verifying Reachability-Logic Properties on Rewriting-Logic Specifications

Dorel Lucanu (1) , Vlad Rusu (2) , Andrei Arusoaie (2) , David Nowak (3, 4)

1 Department of Computer Science [Lasi]
2 DREAMPAL - Dynamic Reconfigurable Massively Parallel Architectures and Languages
3 2XS - Extra Small Extra Safe
4 CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189

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.

Domaines: Logique en informatique [cs.LO]

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⟩