Verification of partial designs using incremental QBF

DOI10.3233/AIC-140633MaRDI QIDQ4589096zbMATH OpenOpenAlexFDO

Authors Christian R. Miller, Paolo Marin, Bernd Becker

Publication date 7 November 2017

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/aic-140633

zbMATH Keywords

blackboxBMCincremental QBFpartial design verification

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Automated benchmarking of incremental SAT and QBF solvers
• Incremental QBF solving by DepQBF
• Conformant planning as a case study of incremental QBF solving
• scientific article; zbMATH DE number 5542982
• Theory and Applications of Satisfiability Testing

Cited in

(9)

• Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
• scientific article; zbMATH DE number 5542982 (Why is no real title available?)
• Encoding techniques, Craig interpolants and bounded model checking for incomplete designs
• Incremental QBF solving by DepQBF
• Partial quantifier elimination and property generation
• Conformant planning as a case study of incremental QBF solving
• Incremental preprocessing methods for use in BMC
• Automated benchmarking of incremental SAT and QBF solvers
• Understanding and extending incremental determinization for 2QBF

This page was built for publication: Verification of partial designs using incremental QBF

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