Compositional verification in rewriting logic
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1670775 (Why is no real title available?)
- scientific article; zbMATH DE number 4180789 (Why is no real title available?)
- scientific article; zbMATH DE number 3926220 (Why is no real title available?)
- scientific article; zbMATH DE number 4110131 (Why is no real title available?)
- scientific article; zbMATH DE number 1956591 (Why is no real title available?)
- Abstract congruence closure
- Assumption/guarantee specifications in linear-time temporal logic
- Automated Assume-Guarantee Reasoning by Abstraction Refinement
- Automated circular assume-guarantee reasoning
- Compositional specification in rewriting logic
- Compositional verification of asynchronous concurrent systems using CADP
- Conditional rewriting logic as a unified model of concurrency
- Deduction, strategies, and rewriting
- Equational abstractions
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Integrated Formal Methods
- Parameterized programming for compositional system specification
- Predicate abstraction of rewrite theories
- Proofs of Networks of Processes
- Strategies, model checking and branching-time properties in Maude
This page was built for publication: Compositional verification in rewriting logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027170)