Parallel program design: a foundation
Parallel program design: a foundation
Larch: languages and tools for formal specification
Larch: languages and tools for formal specification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
An old-fashioned recipe for real time
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
Symbolic Model Checking
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Rewrite Methods for Clausal and Non-Clausal Theorem Proving
Proceedings of the 10th Colloquium on Automata, Languages and Programming
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 Verification of the Horn-Preneel Micropayment Protocol
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Flaw and modification of the iKP electronic payment protocols
Information Processing Letters
Modeling and Verification of Distributed Real-Time Systems Based on CafeOBJ
Proceedings of the 16th IEEE international conference on Automated software engineering
Behavioral Verification of Distributed Concurrent Systems with BOBJ
QSIC '03 Proceedings of the Third International Conference on Quality Software
We Present a Complete Study Involving in the One Hand
QSIC '04 Proceedings of the Quality Software, Fourth International Conference
Equational Approach to Formal Analysis of TLS
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Chocolat/SMV: A Translator from CafeOBJ into SMV
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
A Lightweight Integration of Theorem Proving and Model Checking for System Verification
APSEC '05 Proceedings of the 12th Asia-Pacific Software Engineering Conference
Automating Invariant Verification of Behavioral Specifications
QSIC '06 Proceedings of the Sixth International Conference on Quality Software
A Toolkit for Generating and Displaying Proof Scores in the OTS/CafeOBJ Method
Electronic Notes in Theoretical Computer Science (ENTCS)
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
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
Verifying security protocols for sensor networks using algebraic specification techniques
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
On the algebraic semantics of reactive rules
RuleML'12 Proceedings of the 6th international conference on Rules on the Web: research and applications
Formal analysis of TESLA protocol in the timed OTS/CafeOBJ method
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: applications and case studies - Volume Part II
| Hi-index | 0.02 |
We describe timed observational transition systems (TOTSs). TOTSs are written in terms of equations. By regarding equations as left-to-right rewrite rules, rewriting, together with induction and/or case analysis, can be used to verify that timing properties hold for TOTSs. Concretely, CafeOBJ, an algebraic specification language, is used to specify TOTSs and verify that TOTSs have timing properties by writing proofs, or proof scores. Two case studies are used to demonstrate how to model real-time systems based on TOTSs, specify TOTSs in CafeOBJ and verify that TOTSs have timing properties with the CafeOBJ system.