Parallel program design: a foundation
Parallel program design: a foundation
An old-fashioned recipe for real time
ACM Transactions on Programming Languages and Systems (TOPLAS)
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Theoretical Computer Science
Distributed Algorithms
Web-Based Support for Cooperative Software Engineering
Annals of Software Engineering
Formal Verification of the MCS List-Based Queuing Lock
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Formally Modeling and Verifying Ricart & Agrawala Distributed Mutual Exclusion Algorithm
APAQS '01 Proceedings of the Second Asia-Pacific Conference on Quality Software
Modeling and verification of real-time systems based on equations
Science of Computer Programming
Verifying Design with Proof Scores
Verified Software: Theories, Tools, Experiments
An Algebraic Framework for Modeling of Mobile Systems
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Fostering proof scores in CafeOBJ
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
| Hi-index | 0.00 |
CafeOBJ is a wide spectrum formal specification languagebased on multiple logical foundations: mainly initialand hidden algebra. A wide range of systems can bespecified in CafeOBJ thanks to its multiple logical foundations.However, distributed real-time systems happen to beexcluded from targets of CafeOBJ. In this paper, we proposea method of modeling and verifying such systems based onCafeOBJ, together with timed evolution of UNITY computationalmodels.