Modalities for model checking (extended abstract): branching time strikes back
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
ACM Computing Surveys (CSUR)
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
"Sometime" is sometimes "not never": on the temporal logic of programs
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Event-Based Temporal Logic Specifications of Services and Protocols
Proceedings of the IFIP WG6.1 Second International Workshop on Protocol Specification, Testing and Verification
The Temporal Semantics of Concurrent Programs
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
TIMESETS -- A New Method for Temporal Reasoning about Programs
Logic of Programs, Workshop
Temporal verification of carrier-sense local area network protocols
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An interval logic for higher-level temporal reasoning
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Reasoning in interval temporal logic
Reasoning in interval temporal logic
Hi-index | 0.00 |
This paper is concerned with the specification and verification of an active message system. Aspects of specification and verification of active messages are discussed. Approaches to the formal specification and verification of active message design are described. A formal system that is based on temporal logic for describing and analyzing properties of active messages is developed. A proof of the termination of an active message is given as an example to clarify the concepts discussed in the paper.