Mechanically verifying concurrent programs with the Boyer-Moore prover
Author:
- D.M. GoldschlagDGD.M. Goldschlag
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 16 (9) , 1005-1023
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Mechanizing CSP trace theory in higher order logicIEEE Transactions on Software Engineering, 1990
- Microprocessor design verificationJournal of Automated Reasoning, 1989
- A simple approach to specifying concurrent systemsCommunications of the ACM, 1989
- A mechanical proof of the Church-Rosser theoremJournal of the ACM, 1988
- Soundness of Hoare's logic: an automated proof using LCFACM Transactions on Programming Languages and Systems, 1987
- Safety without stutteringInformation Processing Letters, 1986
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Defining livenessInformation Processing Letters, 1985
- Adequate proof principles for invariance and liveness properties of concurrent programsScience of Computer Programming, 1984
- An axiomatic basis for computer programmingCommunications of the ACM, 1969