Efficient SAT-based bounded model checking for software verification-Reference-Cited by-同舟云学术

Efficient SAT-based bounded model checking for software verification

Published:2008-09 Issue:3 Volume:404 Page:256-274
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Ivančić Franjo,Yang Zijiang,Ganai Malay K.,Gupta Aarti,Ashar Pranav

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference72 articles.

1. Model-checking in dense real-time;Alur;Information and Computation,1993

2. R. Alur, L. deAlfaro, R. Grosu, T.A. Henzinger, M. Kang, R. Majumdar, F. Mang, C.M. Kirsch, B.Y. Wang, MOCHA: A model checking tool that exploits design structure, in: Intern. Conf. on Software Engineering, 2001, pp. 835–836

3. R. Alur, B.-Y. Wang, Verifying network protocol implementations by symbolic refinement checking, in: 13th Conference on Computer Aided Verification, 2001, pp. 169–181

4. T. Ball, R. Majumdar, T.D. Millstein, S.K. Rajamani, Automatic predicate abstraction of C programs, in: ACM SIGPLAN Conference on Programming Language Design and Implementation, 2001, pp. 203–213

5. Bebop: A symbolic model checker for Boolean programs;Ball,2000

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

1. GraSS: Combining Graph Neural Networks with Expert Knowledge for SAT Solver Selection;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

2. Comparison of Ethereum Smart Contract Analysis and Verification Methods;Lecture Notes in Computer Science;2024

3. Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms;Physical Review Research;2023-06-05

4. A Bloom Filter-based Algorithm for Fast Detection of Common Variables;2023 International Conference on Frontiers of Robotics and Software Engineering (FRSE);2023-06

5. A proof system for unified temporal logic;Theoretical Computer Science;2023-03