Can BDDs compete with SAT solvers on bounded model checking?
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Gianpiero Cabodi, Paolo Camurati, Stefano Quer
Can BDDs compete with SAT solvers on bounded model checking?
DAC, 2002.

DAC 2002
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{DAC-2002-CabodiCQ,
	author        = "Gianpiero Cabodi and Paolo Camurati and Stefano Quer",
	booktitle     = "{Proceedings of the 39th Design Automation Conference}",
	doi           = "10.1145/513918.513949",
	isbn          = "1-58113-461-4",
	pages         = "117--122",
	publisher     = "{ACM}",
	title         = "{Can BDDs compete with SAT solvers on bounded model checking?}",
	year          = 2002,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.