Generate \& check method for verifying transition systems in CafeOBJ
From MaRDI portal
Publication:5256348
Recommendations
Cites work
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- 25 years of model checking. History, achievements, perspectives
- Abstract logical model checking of infinite-state systems using narrowing
- CafeOBJ Traces
- Cardinals in Isabelle/HOL
- Incremental proofs of termination, confluence and sufficient completeness of OBJ specifications
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Principles of proof scores in CafeOBJ
- Proof scores in the OTS/CafeOBJ method.
- Proving Safety Properties of Rewrite Theories
- Symbolic Model Checking of Infinite-State Systems Using Narrowing
- Twenty years of rewriting logic
- Universe polymorphism in Coq
Cited in
(6)- Generic proof scores for generate \& check method in CafeOBJ
- Using CafeOBJ to mechanise refactoring proofs and application
- A Maude environment for CafeOBJ
- scientific article; zbMATH DE number 1962762 (Why is no real title available?)
- Liveness properties in CafeOBJ -- a case study for meta-level specifications
- From hidden to visible: a unified framework for transforming behavioral theories into rewrite theories
This page was built for publication: Generate \& check method for verifying transition systems in CafeOBJ
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5256348)