SAT-Based Model Checking without Unrolling-Reference-Cited by-同舟云学术

SAT-Based Model Checking without Unrolling

Published:2011 Issue: Volume: Page:70-87
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bradley Aaron R.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-18275-4_7

Reference25 articles.

1. Awedh, M., Somenzi, F.: Automatic invariant strengthening to prove properties in bounded model checking. In: DAC, pp. 1073–1076. ACM Press, New York (2006)

2. Lecture Notes in Computer Science;A. Biere,1999

3. Biere, A., Claessen, K.: Hardware model checking competition. In: Hardware Verification Workshop (2010)

4. Bradley, A.R.: Safety Analysis of Systems. PhD thesis, Stanford University (May 2007)

5. Bradley, A.R.: k-step relative inductive generalization. Tech. Rep., CU Boulder (March 2010), http://arxiv.org/abs/1003.3649

Cited by 368 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Boosting Constrained Horn Solving by Unsat Core Learning;Lecture Notes in Computer Science;2023-12-30

2. Interpolation and Quantifiers in Ortholattices;Lecture Notes in Computer Science;2023-12-30

3. Automatic and Incremental Repair for Speculative Information Leaks;Lecture Notes in Computer Science;2023-12-30

4. r-map: Relating Implementation and Specification in Hardware Refinement Checking;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2023-12

5. LightF3: A Lightweight Fully-Process Formal Framework for Automated Verifying Railway Interlocking Systems;Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2023-11-30