Communicating sequential processes
Communicating sequential processes
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving Partial Order Liveness Properties
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Analysis of Timeliness Requirements in Safety-Critical Systems
Proceedings of the Second International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Reasoning in Interval Temporal Logic
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Design of self-checking software
Proceedings of the international conference on Reliable software
| Hi-index | 0.00 |
The process of showing that a program satisfies some particular properties with respect to its specification is called program verification. Axiomatic semantics is a verification method that makes assertions describing properties about the states of a program. There exists a transformation from the assertions of a program’s verification proof to executable assertions. The latter may be embedded in the program to make it fault tolerant. An axiomatic proof system for concurrent programs is applied to generate executable assertions in a real time distributed environment. A train set example is used as modelproblem.