A Verification Logic for Rewriting Logic
From MaRDI portal
Temporal logic (03B44) Modal logic (including the logic of norms) (03B45) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cited in
(14)- Modal logic for rewriting theories
- scientific article; zbMATH DE number 1617312 (Why is no real title available?)
- Proving modal properties of rewrite theories using Maude's metalevel
- Characterization Theorems for Revision of Logic Programs
- Verifying Reachability-Logic Properties on Rewriting-Logic Specifications
- Abstract Certification of Global Non-interference in Rewriting Logic
- Graph-Based Design and Analysis of Dynamic Software Architectures
- Verification logic
- scientific article; zbMATH DE number 6863635 (Why is no real title available?)
- A rewriting-based model checker for the linear temporal logic of rewriting
- Theoretical Aspects of Computing – ICTAC 2005
- Representational reasoning and verification
- Verification for everyone? An overview of dynamic logic
- Verification of the IBOS Browser Security Properties in Reachability Logic
This page was built for publication: A Verification Logic for Rewriting Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3025340)