Proving QBF-hardness in Bounded Model Checking for Incomplete Designs

Christian Miller, Christoph Scholl, Bernd Becker. Proving QBF-hardness in Bounded Model Checking for Incomplete Designs. In 14th International Workshop on Microprocessor Test and Verification, MTV 2013, Austin, TX, USA, December 11-13, 2013. pages 23-28, IEEE, 2013. [doi]

Abstract

Abstract is missing.