Applying SAT Methods in Unbounded Symbolic Model Checking-Reference-Cited by-同舟云学术

Applying SAT Methods in Unbounded Symbolic Model Checking

Published:2002 Issue: Volume: Page:250-264
ISSN:0302-9743
Container-title:Computer Aided Verification
language:
Short-container-title:

Author:

McMillan Ken L.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45657-0_19

Reference17 articles.

1. Lect Notes Comput Sci;P. A. Abdulla,2000

2. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In TACAS 1999, pages 193–207, 1999.

3. P. Bjesse. Symbolic model checking with sets of states represented as formulas. Technical Report CS-1999-100, Department of Computer Science, Chalmers technical university, March 1999.

4. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8), 1986.

5. J. R. Burch, E. M. Clarke, and D. E. Long. Symbolic model checking with partitioned transition relations. In A. Halaas and P. B. Denyer, editors, VLSI’ 91, Edinburgh, Scotland, August 1991.

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

1. Avoiding the Shoals - A New Approach to Liveness Checking;Lecture Notes in Computer Science;2024

2. Accelerate Safety Model Checking Based on Complementary Approximate Reachability;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2023-09

3. Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods;Journal of Combinatorial Designs;2023-02-05

4. Partial Quantifier Elimination and Property Generation;Computer Aided Verification;2023

5. SMT-Based Unbounded Model Checking for ATL;Lecture Notes in Computer Science;2022