Mechanically Verifying Concurrent Programs with the Boyer-Moore Prove

Authors:
D. M. Goldschlag
Affiliations:
-
Venue:
IEEE Transactions on Software Engineering
Year:
1990

Citing 14
Cited 9

Adequate proof principles for invariance and liveness properties of concurrent programs

Science of Computer Programming
Automatic verification of finite-state concurrent systems using temporal logic specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Safety without stuttering

Information Processing Letters
Soundness of Hoare's logic: an automated proof using LCF

ACM Transactions on Programming Languages and Systems (TOPLAS)
Common LISP: the language

Common LISP: the language
A mechanical proof of the Church-Rosser theorem

Journal of the ACM (JACM)
The addition of bounded quantification and partial functions to a computational logic and its theorem prover

Journal of Automated Reasoning
A computational logic handbook

A computational logic handbook
Parallel program design: a foundation

Parallel program design: a foundation
A simple approach to specifying concurrent systems

Communications of the ACM
Trace theory for automatic hierarchical verification of speed-independent circuits

Trace theory for automatic hierarchical verification of speed-independent circuits
Microprocessor design verification

Journal of Automated Reasoning
Mechanizing CSP Trace Theory in Higher Order Logic

IEEE Transactions on Software Engineering
An axiomatic basis for computer programming

Communications of the ACM

An experience in the formal verification of industrial software

Communications of the ACM - Electronic supplement to the December issue
Formal Verification of Concurrent Programs Using the Larch Prover

IEEE Transactions on Software Engineering
A Mechanization of Unity in PC-NQTHM-92

Journal of Automated Reasoning
Formal Derivation of Concurrent Programs: An Example from Industry

IEEE Transactions on Software Engineering
Compositionality for Tightly Coupled Systems: A New Application of the Propositions-as-Types Interpretation

Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
Compositionality for Tightly Coupled Systems: A New Application of the Propositions-as-Types Interpretation

Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of stack manipulation in the SCIP processor

SSV'10 Proceedings of the 5th international conference on Systems software verification
Compositionality for Tightly Coupled Systems: A New Application of the Propositions-as-Types Interpretation

Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
Specification and Verification of Concurrent Programs Through Refinements

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

A proof system suitable for the mechanical verification of concurrent programs is described. This proof system is based on Unity, and may be used to specify and verify both safety and liveness properties. However, it is defined with respect to an operational semantics of the transition system model of concurrency. Proof rules are simply theorems of this operational semantics. This methodology makes a clear distinction between the theorems in the proof system and the logical inference rules and syntax which define the underlying logic. Since this proof system essentially encodes Unity in another sound logic, and this encoding has been mechanically verified, this encoding proves the soundness of this formalization of Unity. This proof system has been mechanically verified by the Boyer-Moore prover. This proof system has been used to mechanically verify the correctness of a distributed algorithm that computes the minimum node value in a tree.