K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In E. Brinksma and K. G. Larsen, editors, Fourteenth Conference on Computer Aided Verification (CAV'02), pages 250-264. Berlin, July 2002. LNCS 2404. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Boolean Approach to Unbounded, Fully Symbolic Model.. - Seshia, Bryant (2003) (Correct)
.... with previous work on deciding SL formulas via a translation to Boolean satisfiability (SAT) 17] allow us to leverage well known techniques for manipulating quantified Boolean formulas, including Binary Decision Diagrams (BDDs) and recent work on SAT and SAT based quantifier elimination [13]. Related Work. The work that is most closely related to ours is the approach based on representing SL formulas using Di#erence Decision Diagrams (DDDs) 14] A DDD is a BDD like data structure, where the node labels are generalized to be separation predicates rather than just Boolean variables, ....
Ken L. McMillan. Applying SAT methods in unbounded symbolic model checking. In E. Brinksma and K. G. Larsen, editors, Proc. 14th Intl. Conference on Computer-Aided Verification (CAV'02), LNCS 2404, pages 250--264. Springer-Verlag, July 2002.
Unbounded, Fully Symbolic Model Checking of Timed Automata.. - Seshia, Bryant (Correct)
.... with previous work on deciding SL formulas via a translation to Boolean satis ability (SAT) 16] allow us to leverage well known techniques for manipulating quanti ed Boolean formulas, including Binary Decision Diagrams (BDDs) and recent work on SAT and SAT based quanti er elimination [11]. Related Work. The work that is most closely related to ours is the approach based on representing SL formulas using Di erence Decision Diagrams (DDDs) 12] A DDD is a BDD like data structure, where the node labels are generalized to be separation predicates rather than just Boolean variables, ....
K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In Proc. CAV'02, LNCS 2404, pages 250-264.
Efficient Preimage Computation Using A Novel Success-Driven ATPG - Sheng, Hsiao (2003) (1 citation) (Correct)
....and space explosion problems. We call this phenomenon as solution explosion. This is also the reason why the authors of [7] avoid having the SAT solver run to a leaf node of the decision tree, but instead they let BDDs finish off the decision tree starting at intermediate nodes. In a recent work [9], a SAT solver is employed to perform quantifier elimination for symbolic model checking. The problem is similar to our problem of enumerating all solutions. The author relied on CNF representation of circuit and modified zCHAFF [4] such that whenever a solution is found, a blocking clause is ....
K. L. McMillan, "Applying SAT methods in Unbounded Symbolic Model Checking", Proc. CAV, 2002.
An Analysis of SAT-based Model Checking - Techniques In An (2005) Self-citation (Mcmillan) (Correct)
No context found.
K. McMillan. Applying SAT methods in unbounded symbolic model checking. In CAV, 2003.
Minimizing Counterexample - With Unit Core (Correct)
No context found.
K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In E. Brinksma and K. G. Larsen, editors, Fourteenth Conference on Computer Aided Verification (CAV'02), pages 250-264. Berlin, July 2002. LNCS 2404.
A Symbolic Approach to Predicate Abstraction - Shuvendu Lahiri Randal (2003) (4 citations) (Correct)
No context found.
K. L. McMillan. Applying SAT Methods in Unbounded Symbolic Model Checking. In Computer Aided Veri cation, (CAV '02), LNCS 2404, 2002.
Predicate Abstraction of - Ansi--C Programs Using (Correct)
No context found.
K.L. McMillan. Applying SAT methods in unbounded symbolic model checking. In 14th Conference on Computer Aided Verification, pages 250--264, 2002.
Unbounded Model Checking for Knowledge and Time - Kacprzak, Lomuscio, Penczek (2003) (Correct)
No context found.
K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In Proc. of the 14th Int. Conf. on Computer Aided Verification (CAV'02), volume 2404 of LNCS, pages 250-- 264. Springer-Verlag, 2002.
Verification of Multiagent Systems via Ordered Binary.. - Raimondi, Lomuscio (2004) (Correct)
No context found.
K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. Lecture Notes in Computer Science, 2404:250--260, 2002.
Unbounded Model Checking for Knowledge and Time - Kacprzak, Lomuscio, Penczek (2003) (Correct)
No context found.
K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In Proc. of the 14th Int. Conf. on Computer Aided Verification (CAV'02), volume 2404 of LNCS, pages 250--264. Springer-Verlag, 2002.
Verification of Multiagent Systems via Unbounded Model.. - Kacprzak, Lomuscio.. (2004) (Correct)
No context found.
K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In Proc. of the 14th Int. Conf. on Computer Aided Verification (CAV'02), volume 2404 of LNCS, pages 250--264. Springer-Verlag, 2002.
Verification of Multiagent Systems via Ordered Binary.. - Raimondi, Lomuscio (2004) (Correct)
No context found.
K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. Lecture Notes in Computer Science, 2404:250--260, 2002.
Unbounded Model Checking for Alternating-Time Temporal Logic - Kacprzak, Penczek (2004) (Correct)
No context found.
K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In Proc. of the 14th Int. Conf. on Computer Aided Verification (CAV'02), volume 2404 of LNCS, pages 250--264. Springer-Verlag, 2002.
Verification of Multiagent Systems via Ordered Binary.. - Raimondi, Lomuscio (2004) (Correct)
No context found.
K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. Lecture Notes in Computer Science, 2404:250--260, 2002.
Verification of Multiagent Systems via Unbounded Model.. - Kacprzak, Lomuscio.. (2004) (Correct)
No context found.
K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In Proc. of the 14th Int. Conf. on Computer Aided Verification (CAV'02), volume 2404 of LNCS, pages 250--264. Springer-Verlag, 2002.
A Symbolic Approach to Predicate Abstraction - Lahiri, Bryant, Cook (2003) (4 citations) (Correct)
No context found.
K. L. McMillan. Applying SAT Methods in Unbounded Symbolic Model Checking. In Computer Aided Veri cation, (CAV '02), LNCS 2404, 2002.
Predicate Abstraction of ANSI-C Programs using SAT - Clarke, Kroening, Sharygina, .. (2003) (2 citations) (Correct)
No context found.
K.L. McMillan. Applying sat methods in unbounded symbolic model checking. In 14th Conference on Computer Aided Verification, pages 250--264, 2002.
SAT based Predicate Abstraction for Hardware Verification - Clarke, Talupur, Veith, Wang (2002) (Correct)
No context found.
K. McMillan. Applying SAT methods in unbounded symbolic model checking. In CAV'02, pages 250--264, 2002.
A SAT-Based Algorithm for Reparameterization in Symbolic.. - Chauhan, Kroening, Clarke (2003) (Correct)
No context found.
Ken McMillan. Applying SAT methods in unbounded symbolic model checking. In Ed Brinksma and Kim Guldstrand Larsen, editors, Proceedings of the International Conference on ComputerAided Verification (CAV 2002), volume 2404 of Lecture Notes in Computer Science, pages 250--264. Springer, 2002.
Bounded Model Checking and Induction: From Refutation to.. - de Moura, Rueß, Sorea (2003) (6 citations) (Correct)
No context found.
K. McMillan. Applying SAT methods in unbounded symbolic model checking. In Computer-Aided Veri cation, CAV 2002, volume 2404 of LNCS. Springer-Verlag, 2002.
ATPG-based PreImage Computation: Efficient Search Space .. - Kameshwar Chandrasekar .. (Correct)
No context found.
K. L. McMillan, "Applying SAT methods in unbounded symbolic model checking", Proc. CAV, 2002, pp. 250-264.
Improving SAT-based Bounded Model Checking by Means of.. - Approximate Traversals .. (2003) (Correct)
No context found.
K. L. McMillan. Applying SAT Methods in Unbounded Symbolic Model Checking. In Ed Brinksma and Kim Guldstrand Larsen, editors, Proc. Computer Aided Verification, volume 2404 of LNCS, pages 250--264, Cophenagen, Denmark, 2002.
Using SAT based Image Computation for Reachability - Analysis Pankaj Chauhan (2003) (Correct)
No context found.
Ken McMillan. Applying SAT methods in unbounded symbolic model checking. In Ed Brinksma and Kim Guldstrand Larsen, editors, Proceedings of the International Conference on Computer-Aided Verification (CAV'02), volume 2404 of Lecture Notes in Computer Science, pages 250--264. Springer, 2002.
A Novel SAT All-Solutions Solver for Efficient Preimage.. - Bin Li Department (Correct)
No context found.
K. L. McMillan. Applying sat methods in unbounded symbolic model checking. Proc. CAV, pages 250--264, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC