On the Magnitude of Completeness Thresholds in Bounded Model Checking

DOI10.1109/LICS.2012.27zbMath1360.68579WikidataQ130991252 ScholiaQ130991252MaRDI QIDQ2986792

Daniel Bundala, Joël Ouaknine, James Worrell

Publication date: 16 May 2017

Published in: 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

zbMATH Keywords

automata theorybounded model checkingcomputer-aided verification

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Formally verified algorithms for upper-bounding state space diameters

This page was built for publication: On the Magnitude of Completeness Thresholds in Bounded Model Checking