Bounded Model Checking of Software Using SMT Solvers Instead of SAT Solvers-Reference-Cited by-同舟云学术

Bounded Model Checking of Software Using SMT Solvers Instead of SAT Solvers

Published:2006 Issue: Volume: Page:146-162
ISSN:0302-9743
Container-title:Model Checking Software
language:
Short-container-title:

Author:

Armando Alessandro,Mantovani Jacopo,Platania Lorenzo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11691617_9

Reference31 articles.

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

2. Kroening, D., Clarke, E., Yorav, K.: Behavioral consistency of C and Verilog programs using bounded model checking. In: Proceedings of DAC 2003, pp. 368–371. ACM Press, New York (2003)

3. Lecture Notes in Computer Science;E. Clarke,2004

4. Nelson, G., Oppen, D.: Simplification by Cooperating Decision Procedures. ACM Transactions on Programming Languages and Systems 1, 245–257 (1979)

5. Shostak, R.E.: Deciding Combinations of Theories. Journal of ACM 31, 1–12 (1984)

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

1. Towards Abstraction-based Probabilistic Program Analysis;Acta Cybernetica;2023-06-02

2. SMPT: A Testbed for Reachability Methods in Generalized Petri Nets;Formal Methods;2023

3. Review of Software Model-Checking Techniques for Dealing with Error Detection in Program Codes;Journal of Software Engineering and Applications;2023

4. On the Combination of Polyhedral Abstraction and SMT-Based Model Checking for Petri Nets;Application and Theory of Petri Nets and Concurrency;2021

5. Making Bounded Model Checking Interprocedural in (Static Analysis) Style;Communications in Computer and Information Science;2021