Mechanizing a proof by induction of process algebra specifications in higher order logic
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 288-298
- https://doi.org/10.1007/3-540-55179-4_28
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Combining interaction and automation in process algebra verificationPublished by Springer Nature ,1991
- A rewriting strategy to verify observational congruenceInformation Processing Letters, 1990
- Using the axiomatic presentation of behavioural equivalences for manipulating CCS specificationsPublished by Springer Nature ,1990
- Mechanizing CSP trace theory in higher order logicIEEE Transactions on Software Engineering, 1990
- Automating Recursive Type Definitions in Higher Order LogicPublished by Springer Nature ,1989
- Mechanizing Programming Logics in Higher Order LogicPublished by Springer Nature ,1989
- Type theory and concurrencyInternational Journal of Parallel Programming, 1988
- HOL: A Proof Generating System for Higher-Order LogicPublished by Springer Nature ,1988
- Logic and ComputationPublished by Cambridge University Press (CUP) ,1987