Nonclausal deduction in first-order temporal logic
Journal of the ACM (JACM)
Object-oriented logical specification of time-critical systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
Deciding Properties of Timed Transition Models
IEEE Transactions on Parallel and Distributed Systems
Resource controller tasks in ADA: Their structure and semantics
ICSE '84 Proceedings of the 7th international conference on Software engineering
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
Generation of concurrency control code using discrete-event systems theory
Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
Concurrency control generation for dynamic threads using discrete-event systems
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
| Hi-index | 0.00 |
A proof system based on temporal logic is presented for proving properties of concurrent programs based on the shared-variables computation model. The system consists of three parts: the general uninterpreted part, the domain dependent part and the program dependent part. In the general part we give a complete proof system for first-order temporal logic with detailed proofs of useful theorems. This logic enables reasoning about general time sequences. The domain dependent part characterizes the special properties of the domain over which the program operates. The program dependent part introduces program axioms which restrict the time sequences considered to be execution sequences of a given program. The utility of the full system is demonstrated by proving invariance, liveness and precedence properties of several concurrent programs. Derived proof principles for these classes of properties are obtained and lead to a compact representation of proofs.