Combining theorem proving and narrowing for rewriting-logic specifications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Combining theorem proving and narrowing for rewriting-logic specifications

Abstract

We present an approach for verifying dynamic systems specified in rewriting logic, a formal specification language implemented in the Maude system. Our approach is tailored for invariants, i.e., properties that hold on all states reachable from a given class of initial states. The approach consists in encoding invariance properties into inductive properties written in membership equational logic, a sublogic of rewriting logic also implemented in Maude. The invariants can then be verified using an inductive theorem prover available for membership equational logic, possibly in interaction with narrowing-based symbolic analysis tools for rewriting-logic specifications also available in the Maude environment. We show that it is possible, and useful, to automatically test invariants by symbolic analysis before interactively proving them.
Fichier principal
Vignette du fichier
2010-tap.pdf (292.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00527864 , version 1 (20-10-2010)

Identifiers

  • HAL Id : inria-00527864 , version 1

Cite

Vlad Rusu. Combining theorem proving and narrowing for rewriting-logic specifications. International Conference on Tests and Proofs, 2010, Malaga, Spain. ⟨inria-00527864⟩

Collections

INRIA INRIA2
67 View
162 Download

Share

Gmail Facebook X LinkedIn More