POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Extending Ina Jo with Temporal Logic
IEEE Transactions on Software Engineering
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Strategies for incorporating formal specifications in software development
Communications of the ACM
A model and temporal proof system for networks of processes
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Temporal Framework for Database Specifications
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
A method of automatic proof for the specification and verification of protocols
SIGCOMM '84 Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium
A methodology for verifying request processing protocols
SIGCOMM '83 Proceedings of the symposium on Communications Architectures & Protocols
A description and reasoning of plant controllers in temporal logic
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.02 |
This is the first in a series of reports describing the application of temporal logic to the specification and verification of concurrent programs. We first introduce temporal logic as a tool for reasoning about sequences of states. Models of concurrent programs based both on transition graphs and on linear-text representations are presented and the notions of concurrent and fair executions are defined. The general temporal language is then specialized to reason aboaut those execution sequences that are fair computations of a concurrent program. Subsequently, the language is used to describe properties of concurrent programs. The set of interesting properties is classified into invariance (safety), eventuality (liveness), and precedence (until) properties. Among the properties studied are: partial correctness, global invariance, clean behavior, mutual exclusion, absence of deadlock, termination, total correctness, intermittent assertions, accessibility, responsiveness, safe liveness, absence of unsolicited response, fair responsiveness, and precedence. In the following reports of this series, we will use the temporal formalism to develop proof methodologies for proving the properties discussed here.