Efficient and timely mutual authentication
ACM SIGOPS Operating Systems Review
Larch: languages and tools for formal specification
Larch: languages and tools for formal specification
Theoretical Computer Science
Web-Based Support for Cooperative Software Engineering
Annals of Software Engineering
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Formal analysis of Suzuki & Kasami distributed mutual exclusion algorithm
FMOODS '02 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V
Behavioral Verification of Distributed Concurrent Systems with BOBJ
QSIC '03 Proceedings of the Third International Conference on Quality Software
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
Formal analysis of the iKP electronic payment protocols
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Modeling and verification of real-time systems based on equations
Science of Computer Programming
Verifying Design with Proof Scores
Verified Software: Theories, Tools, Experiments
| Hi-index | 0.00 |
The OTS/CafeOBJ method can be used to model, specify and verify distributed systems. Specifications are written in equations, which are regarded as rewrite rules and used to verify specifications. The usefulness of the method is demonstrated by applying the method to nontrivial problems such as electronic commerce protocols and railroad signaling systems. In this paper we describe a toolkit called Buffet, which assists verification in the method. Given predicates used to split cases and lemmas, Buffet automatically generates proofs (called proof scores) and checks the proof scores using the CafeOBJ system. Buffet also has facilities to display proof scores generated and verification results on a web browser.