Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
Verifying Concurrent Processes Using Temporal Logic
Verifying Concurrent Processes Using Temporal Logic
Specification and Verification of Networks Protocols Using
Proceedings of the 6th Colloquium on International Symposium on Programming
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
A Decision Method for Linear Temporal Logic
Proceedings of the 7th International Conference on Automated Deduction
Verification of concurrent programs, Part I: The temporal framework
Verification of concurrent programs, Part I: The temporal framework
Verification of concurrent programs: a temporal proof system
Verification of concurrent programs: a temporal proof system
Nonclausal deduction in first-order temporal logic
Journal of the ACM (JACM)
Invariant-Free Clausal Temporal Resolution
Journal of Automated Reasoning
| Hi-index | 0.00 |
In this paper we apply a method of automatic proof to verify some properties of a computer network protocol. The method used is defined as an extension of classical resolution to temporal operators (@@@@), (@@@@), (@@@@) and Until. We define a Precedes operator that is very useful for the specification of protocols. The method has the form of a set of recursive rules. The examples that we give are FIFO and LIFO queues and the alternating bit protocol, and the properties that we verify are livennes properties of the Sender and Receiver processes in order to prove a liveness property of the global system.