Robust QBF Encodings for Sequential Circuits with Applications to Verification, Debug, and Test

DOI10.1109/TC.2010.74zbMath1366.94786OpenAlexW2154269166MaRDI QIDQ5280739

Hratch Mangassarian, Marco H. Benedetti, Andreas G. Veneris

Publication date: 27 July 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2010.74

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12)

Related Items (7)

Hardness Characterisations and Size-width Lower Bounds for QBF Resolution ⋮ Unnamed Item ⋮ A QBF-based formalization of abstract argumentation semantics ⋮ Lower bound techniques for QBF expansion ⋮ Unnamed Item ⋮ Building strategies into QBF proofs ⋮ Solution to PSPACE-complete problem using P systems with active membranes with time-freeness

This page was built for publication: Robust QBF Encodings for Sequential Circuits with Applications to Verification, Debug, and Test