Formalization of graph search algorithms and its applications
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 479-496
- https://doi.org/10.1007/bfb0055153
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Formal verification of a partial-order reduction technique for model checkingPublished by Springer Nature ,1996
- Formalization of planar graphsPublished by Springer Nature ,1995
- The Boyer-Moore prover and Nuprl: an experimental comparisonPublished by Cambridge University Press (CUP) ,1991
- A unified approach to global program optimizationPublished by Association for Computing Machinery (ACM) ,1973
- A formulation of the simple theory of typesThe Journal of Symbolic Logic, 1940