Dominant controllability check using QBF-solver and netlist optimizer

DOI10.1007/978-3-319-09284-3_18MaRDI QIDQ3192072zbMATH OpenOpenAlexFDO

Authors Tamir Heyman, Dan Smith, Yogesh Mahajan, Lance Leong, Husam abu-Haimed

Publication date 26 September 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09284-3_18

zbMATH Keywords

controllabilitynetlist optimizerQBFQBF preprocessor

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Formal verification for non-formalists
• Correct Hardware Design and Verification Methods
• Using word-level information in formal hardware verification
• scientific article; zbMATH DE number 2113572
• A methodology for hardware verification using compositional model checking

Cited in

(2)

• Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
• Conformant planning as a case study of incremental QBF solving

Describes a project that uses

Uses Software

• sQueezeBF

This page was built for publication: Dominant controllability check using QBF-solver and netlist optimizer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192072)