Generic Proof Scores for Generate & Check Method in CafeOBJ
From MaRDI portal
Publication:2945712
DOI10.1007/978-3-319-23165-5_14zbMath1321.68345OpenAlexW2296171818MaRDI QIDQ2945712
Publication date: 14 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-23165-5_14
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Isabelle/HOL. A proof assistant for higher-order logic
- Principles of proof scores in CafeOBJ
- Twenty years of rewriting logic
- Abstract Logical Model Checking of Infinite-State Systems Using Narrowing
- Proving Safety Properties of Rewrite Theories
- Generate & Check Method for Verifying Transition Systems in CafeOBJ
- On Automation of OTS/CafeOBJ Method
- Symbolic Model Checking of Infinite-State Systems Using Narrowing
- Formal Methods for Open Object-Based Distributed Systems
This page was built for publication: Generic Proof Scores for Generate & Check Method in CafeOBJ
