Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover

Hasan Amjad. Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover. In David A. Basin, Burkhart Wolff, editors, Theorem Proving in Higher Order Logics, 16th International Conference, TPHOLs 2003, Rom, Italy, September 8-12, 2003, Proceedings. Volume 2758 of Lecture Notes in Computer Science, pages 171-187, Springer, 2003. [doi]

@inproceedings{Amjad03,
  title = {Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover},
  author = {Hasan Amjad},
  year = {2003},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2758&spage=171},
  tags = {programming},
  researchr = {https://researchr.org/publication/Amjad03},
  cites = {0},
  citedby = {0},
  pages = {171-187},
  booktitle = {Theorem Proving in Higher Order Logics, 16th International Conference, TPHOLs 2003, Rom, Italy, September 8-12, 2003, Proceedings},
  editor = {David A. Basin and Burkhart Wolff},
  volume = {2758},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-40664-6},
}