Using a theorem prover for reasoning about concurrent algorithms
- 1 January 1993
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Refinement concepts formalised in higher order logicFormal Aspects of Computing, 1990
- Mechanizing CSP trace theory in higher order logicIEEE Transactions on Software Engineering, 1990
- A formulation of the simple theory of typesThe Journal of Symbolic Logic, 1940