Conflict driven learning in a quantified Boolean Satisfiability solver

Within the verification community, there has been a recent increase in interest in Quantified Boolean Formula evaluation (QBF) as many interesting sequential circuit verification problems can be formulated as QBF instances. A closely related research area to QBF is Boolean Satisfiability (SAT). Rece...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design s. 442 - 449
Hlavní autoři:	Zhang, Lintao, Malik, Sharad
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	New York, NY, USA ACM 10.11.2002 IEEE
Edice:	ACM Conferences
Témata:	Applied sciences Computing methodologies > Symbolic and algebraic manipulation Computing methodologies > Symbolic and algebraic manipulation > Symbolic and algebraic algorithms Design. Technologies. Operation analysis. Testing Electronics Exact sciences and technology Hardware > Hardware validation > Functional verification Hardware > Integrated circuits > Logic circuits > Sequential circuits Integrated circuits Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices Testing, measurement, noise and reliability Theory of computation > Design and analysis of algorithms Learning Sequential circuit Circuit design Test Constraint satisfaction Computer aided design Satisfiability
ISBN:	0780376072, 9780780376076
ISSN:	1092-3152
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!