Formal derivation of concurrent programs: an example from industry
- 1 May 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 19 (5) , 503-528
- https://doi.org/10.1109/32.232015
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- An exercise in verifying concurrent programs in industry: the I/O subsystemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An experience in the formal verification of industrial softwareCommunications of the ACM, 1996
- A relational notation for state transition systemsIEEE Transactions on Software Engineering, 1990
- An exercise in the formal derivation of parallel programs: maximum flows in graphsACM Transactions on Programming Languages and Systems, 1990
- Mechanically verifying concurrent programs with the Boyer-Moore proverIEEE Transactions on Software Engineering, 1990
- The formal specification and design of a distributed electronic funds-transfer systemIEEE Transactions on Computers, 1988
- Hierarchical correctness proofs for distributed algorithmsPublished by Association for Computing Machinery (ACM) ,1987
- The drinking philosophers problemACM Transactions on Programming Languages and Systems, 1984
- Specifying Concurrent Program ModulesACM Transactions on Programming Languages and Systems, 1983
- An axiomatic proof technique for parallel programs IActa Informatica, 1976