Modeling and verification of real-time systems based on equations
Science of Computer Programming
Verifying Design with Proof Scores
Verified Software: Theories, Tools, Experiments
State Machines as Inductive Types
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A Toolkit for Generating and Displaying Proof Scores in the OTS/CafeOBJ Method
Electronic Notes in Theoretical Computer Science (ENTCS)
Coinductive logic programming and its applications
ICLP'07 Proceedings of the 23rd international conference on Logic programming
ICCS'05 Proceedings of the 13th international conference on Conceptual Structures: common Semantics for Sharing Knowledge
Hi-index | 0.00 |
Following a brief introduction to classical and behavioralalgebraic specification, this paper discusses the verificationof behavioral properties using BOBJ, especially its implementationof conditional circular coinductive rewriting withcase analysis. This formal method is then applied to provingcorrectness of the alternating bit protocol, in one of itsless trivial versions. We have tried to minimize mathematicsin the exposition, in part by giving concrete illustrationsusing the BOBJ system.