Reachability Programming in HOL98 Using BDDs
 Michael J. C. Gordon
 … show all 1 hide
Abstract
Two methods of programming BDDbased symbolic algorithms in the Hol98 proof assistant are presented. The goal is to provide a platform for implementing intimate combinations of deduction and algorithmic verification, like model checking. The first programming method uses a small kernel of ML functions to convert between BDDs, terms and theorems. It is easy to use and is suitable for rapid prototying experiments. The second method requires lowerlevel programming but can support more efficient calculations. It is based on an LCFlike use of an abstract type to encapsulate rules for manipulating judgements ρ t ↦ b meaning “logical term t is represented by BDD b with respect to variable order ρ”. The two methods are illustrated by showing how to perform the standard fixedpoint calculation of the BDD of the set of reachable states of a finite state machine.
 Mark D. Aagaard, Robert B. Jones, and CarlJohan H. Seger. Combining theorem proving and trajectory evaluation in an industrial environment. In Design Automation Conference (DAC), pages 538–541. ACM/IEEE, July 1998.
 Mark D. Aagaard, Robert B. Jones, and CarlJohan H. Seger. LiftedFL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving. In Theorem Proving in Higher Order Logics (TPHOLs99), number 1690 in Lecture Notes in Computer Science, pages 323–340. SpringerVerlag, 1999.
 Randall E. Bryant. Symbolic boolean manipulation with ordered binarydecision diagrams. ACM Computing Surveys, 24(3):293–318, September 1992. CrossRef
 E. Charniak, C. K. Riesbeck, and D. V. McDermott. Artificial Intelligence Programming. Lawrence Erlbaum Associates, 1980.
 M. J. C. Gordon, R. Milner, and C. P. Wadsworth. Edinburgh LCF: A Mechanised Logic of Computation, volume 78 of Lecture Notes in Computer Science. SpringerVerlag, 1979.
 Mike Gordon. Programming combinations of deduction and BDDbased symbolic calculation. Technical Report 480, University of Cambridge Computer Laboratory, December 1999.
 Mike Gordon and Ken Friis Larsen. Combining the Hol98 proof assistant with the BuDDy BDD package. Technical Report 481, University of Cambridge Computer Laboratory, December 1999.
 Scott Hazelhurst and CarlJohan H. Seger. Symbolic trajectory evaluation. In Thomas Kropf, editor, Formal Hardware Verification, chapter 1, pages 3–78. SpringerVerlag, 1997.
 J. Joyce and C. Seger. The HOLVoss System: ModelChecking inside a GeneralPurpose TheoremProver. In J. J. Joyce and C.J. H. Seger, editors, Higher Order Logic Theorem Proving and its Applications: 6th International Workshop, HUG’93, Vancouver, B.C., August 11–13 1993, volume 780 of Lecture Notes in Computer Science, pages 185–198. SpingerVerlag, 1994.
 Edmund M. Clarke Jr. and Orna Grumberg. Model Checking. The MIT Press, 1999.
 Trevor W. S. Lee, Mark R. Greenstreet, and CarlJohan Seger. Automatic verification of asynchronous circuits. Technical Report UBC TR 9340, The University of British Columbia, November 1993.
 K. L. McMillan. A methodology for hardware verification using compositional model checking. Technical report, Cadence Berkeley Labs, April 1999. Available at http://wwwcad.eecs.berkeley.edu/~kenmcmil/.
 Kenneth L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
 John O’Leary, Xudong Zhao, Robert Gerth, and CarlJohan H. Seger. Formally verifying IEEE compliance of floatingpoint hardware. Intel Technology Journal, First Quarter 1999. Online at http://developer.intel.com/technology/itj/.
 S. Rajan, N. Shankar, and M.K. Srivas. An integration of modelchecking with automated proof checking. In Pierre Wolper, editor, ComputerAided Verification, CAV’ 95, volume 939 of Lecture Notes in Computer Science, pages 84–97, Liege, Belgium, June 1995. SpringerVerlag.
 CarlJohan H. Seger. Vossa formal hardware verification system: User’s guide. Technical Report UBC TR 9345, The University of British Columbia, December 1993.
 Title
 Reachability Programming in HOL98 Using BDDs
 Book Title
 Theorem Proving in Higher Order Logics
 Book Subtitle
 13th International Conference, TPHOLs 2000 Portland, OR, USA, August 14–18, 2000 Proceedings
 Pages
 pp 179196
 Copyright
 2000
 DOI
 10.1007/3540446591_12
 Print ISBN
 9783540678632
 Online ISBN
 9783540446590
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 1869
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag Berlin Heidelberg
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors

 Mark Aagaard ^{(4)}
 John Harrison ^{(4)}
 Editor Affiliations

 4. Intel Corporation
 Authors

 Michael J. C. Gordon ^{(5)}
 Author Affiliations

 5. University of Cambridge Computer Laboratory, New Museums Site, Pembroke Street, Cambridge, CB2 3QG, UK
Continue reading...
To view the rest of this content please follow the download PDF link above.