1Aagaard Mark D., Jones Robert B. and Seger Carl-Johan H., ‘Lifted-FL: a pragmatic implementation of combined model checking and theorem proving’, Theorem proving in higher order logics(TPHOLs99), Lecture Notes in Comput. Sci. 1690 (Springer, 1999) 323–340.
2Amarel Saul, ‘On representation of problems of reasoning about action’, Machine intelligence 3 (ed. Michie Donald, Edinburgh University Press, 1971) 131–171.
3Bryant Randall E., Symbolic boolean manipulation with ordered binary-decision diagrams, ACM Computing Surveys 24 (1992) 293–318.
4Clarke Edmund M., Grumberg Orna and Peled Doron A., Model checking (The MIT Press, 1999).
5Coudert Olivier, Berthet Christian and Madre Jean Christophe, ‘Verification of synchronous sequential machines based on symbolic execution’, Automatic verification methods for finite state systems, Lecture Notes in Comput. Sci. 407 (ed. Sifakis J., Springer, 1989) 365–373.
6Gordon Mike, ‘Reachability programming in HOL98 using BDDs’, Proc. 13th International Conference on Theorem Proving and Higher Order Logics (Springer, 2000) 179–196.
8Gordon M.J.C., Milner R. and Wadsworth C. P., Edinburgh LCF: a mechanised logic of computation, Lecture Notes in Comput. Sci. 78 (Springer, 1979).
9Harrison John, ‘Binary decision diagrams as a HOL derived rule’, The Computer Journal 38 (1995) 162–170.
10Hazelhurst Scott, and Seger Carl-Johan H., ‘Symbolic trajectory evaluation’, Formal hardware verification (ed. Kropf Thomas, Springer, 1997) 3–78.
11Joyce J. and Seger C., ‘The HOL-Voss System: model-checking inside a general-purpose theorem-prover’, Higher order logic theorem proving and its applications, 6th International Workshop, HUG'93, Vancouver, B.C., August 11–13 1993, Lecture Notes in Comput.Sci. 780 (ed. Joyce J. J. and Seger C.-J. H., Springer, 1994), 185’198.
12Lee Trevor W.S., Greenstreet Mark R. and Seger Carl-Johan, ‘Automatic verification of asynchronous circuits’, Tech. Rep. UBC TR 93–40, The University of British Columbia (November, 1993).
14McMillan Kenneth L., Symbolic model checking (Kluwer Academic Publishers, 1993).
15McMillan K. L., ‘A compositional rule for hardware design refinement’, Computer- aided verification, CAV '97, Lecture Notes in Comput. Sci. (ed. Grumberg Orna, Springer, Haifa, Israel, 1997) 24–35.
17Milner R., ‘A theory of type polymorphism in programming’, J.Comput.SystemSci 17 (1978) 348–375.
19Rajan S., Shankar N. and Srivas M. K., ‘An integration of model-checking with automated proof checking’, Computer-aided verification, CAV'95, Lecture Notes in Comput.Sci. 939 (ed. Wolper Pierre, Springer, Liege, Belgium, 1995) 84–97.
20Seger Carl-Johan H., ‘VOSS - a formal hardware verification system: User's guide’, Tech. Rep UBC TR 93–45, The University of British Columbia, (December, 1993).