Conference icon

Conference

On the Magnitude of Completeness Thresholds in Bounded Model Checking

Abstract:

Bounded model checking (BMC) is a highly successful bug-finding method that examines paths of bounded length for violations of a given regular or omega-regular specification. A completeness threshold for a given model M and specification phi is a bound k such that, if no counterexample to phi of length k or less can be found in M, then M in fact satisfies phi. The quest for 'small' completeness thresholds in BMC goes back to the very inception of the technique, over a decade ago, and remains ...

Expand abstract
Publication status:
Published

Actions


Access Document


Publisher copy:
10.1109/LICS.2012.27

Authors


Bundala, D More by this author
Ouaknine, J More by this author
More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Pages:
155-164
Publication date:
2012
DOI:
ISSN:
1043-6871
URN:
uuid:db1493b3-0ac5-4538-8c2b-40e31150935f
Source identifiers:
356526
Local pid:
pubs:356526
ISBN:
978-0-7695-4769-5

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP