Verification of partial designs using incremental QBF

DOI10.3233/AIC-140633zbMATH Open1373.68382OpenAlexW1515828819MaRDI QIDQ4589096FDOQ4589096

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

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
• Theory and Applications of Satisfiability Testing

zbMATH Keywords

blackboxBMCincremental QBFpartial design verification

Mathematics Subject Classification ID

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

Cited In (9)

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

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)