Proving Safety Properties of Rewrite Theories
From MaRDI portal
Publication:3090877
DOI10.1007/978-3-642-22944-2_22zbMath1344.68142OpenAlexW1551437553MaRDI QIDQ3090877
Publication date: 2 September 2011
Published in: Algebra and Coalgebra in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2142/17407
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items (10)
Generic Proof Scores for Generate & Check Method in CafeOBJ ⋮ Verifying Reachability-Logic Properties on Rewriting-Logic Specifications ⋮ Twenty years of rewriting logic ⋮ Mechanical Analysis of Reliable Communication in the Alternating Bit Protocol Using the Maude Invariant Analyzer Tool ⋮ Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs ⋮ All-Path Reachability Logic ⋮ Generalized rewrite theories, coherence completion, and symbolic methods ⋮ Simulation and Verification of Synchronous Set Relations in Rewriting Logic ⋮ Generate & Check Method for Verifying Transition Systems in CafeOBJ ⋮ Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description)
Uses Software
This page was built for publication: Proving Safety Properties of Rewrite Theories
