J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 10 20 states and beyond. Information and Computation, 98(2):142--170, June 1992. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Microprocessor Using Symbolic Model Checking without BDDs - Armin Biere Edmund Self-citation (Clarke) (Correct)
No context found.
J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 10 20 states and beyond. Information and Computation, 98(2):142-- 170, June 1992. Originally presented at the 1990 Symposium on Logic in Computer Science (LICS90). 61
Symbolic Model Checking for Probabilistic Processes - Christel Baier Edmund (1997) (31 citations) Self-citation (Clarke) (Correct)
No context found.
J. Burch, E. Clarke, K. McMillan, D. Dill, L. Hwang. Symbolic Model Checking: 10 20 States and Beyond. Information and Computation, 98(2), pp 142-170, 1992.
Tree-Like Counterexamples in Model Checking - Clarke, Jha, Lu, Veith (2002) (9 citations) Self-citation (Clarke) (Correct)
No context found.
J. R. Burch, E. M. Clarke, and K. L. McMillan. Symbolic model checking: 10 20 states and beyond. Information and Computation, 98:142--170, 1992.
An Analysis of SAT-based Model Checking - Techniques In An (2005) Self-citation (Mcmillan) (Correct)
No context found.
J. R. Burch, E. M. Clarke, K. L. McMillan, D.L. Dill, and J. Hwang. Symbolic model checking: 10 20 states and beyond. In LICS, 1990.
Automata-Theoretic Model Checking Revisited - Vardi (Correct)
No context found.
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 10 20 states and beyond. Information and Computation, 98(2):142--170, June 1992.
Automata-Theoretic Techniques for Temporal Reasoning - Vardi (2006) (Correct)
No context found.
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 10 20 states and beyond. Information and Computation, 98(2):142--170, June 1992.
Using B to verify UML Transformations - Lano Dept Of (Correct)
No context found.
Burch, J., Clarke, E., McMillan, K., Dill, D., Hwang, J., Symbolic Model Checking: 10 20 States and Beyond, Proceedings of the Fifth Annual Symposium on Logic in Computer Science, 1990.
Exploiting Symmetry in the Model Checking of Relational.. - Daniel Jackson December (Correct)
No context found.
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill and J. Hwang. Symbolic model checking: 10 20 states and beyond. Proc. 5th Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, June 1990.
Math. Struct. in Comp. Science (2004), vol. 14, pp.. - Cambridge University Press (Correct)
No context found.
Burch, J. R., Clarke, E. M., Dill, D. L., McMillan, K. L. and Hwang, J. (1990) Symbolic model checking: 10 20 states and beyond. Proceedings of the Fifth Annual Symposium on Logic in Computer Science.
Symbolic Model Checking of Declarative Relational Models.. - Fschang Mit Edu (2006) (Correct)
No context found.
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic Model Checking: 10 20 States and Beyond. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, 1990.
I/O Efficient Directed Model Checking - Shahid Jabbar And (Correct)
No context found.
J. R. Burch, E. M.Clarke, K. L. McMillian, and J. Hwang. Symbolic model checking: 10 20 states and beyond. Information and Computation, 98(2):142--170, 1992.
Modal Transition Systems: A Foundation for - Three-Valued Program Analysis (Correct)
No context found.
J. R. Burch, E. M. Clarke, D. L. Dill K. L. McMillan, and J. Hwang. Symbolic model checking: 10 20 states and beyond. Proceedings of the Fifth Annual Symposium on Logic in Computer Science, June 1990.
Relational Programming with CrocoPat - Beyer (2006) (Correct)
No context found.
J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 10 20 states and beyond. Information and Computation, 98(2):142--170, 1992.
Fine-Grain Conjunction Scheduling for Symbolic - Reachability Analysis Hoonsang (2002) (Correct)
No context found.
J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 10 20 states and beyond. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, pages 428--439, June 1990.
Don't Know in the -Calculus - Orna Grumberg Martin (2005) (Correct)
No context found.
J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 10 20 states and beyond. Information and Computation, 98(2):142-- 170, June 1992.
Symbolic Reasoning with Weighted and Normalized Decision.. - Ossowski, Baier (2005) (Correct)
No context found.
J. Burch, E. Clarke, K. McMillan, D. Dill, and L. Hwang. Symbolic model checking: 20 states and beyond. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pages 1--33. IEEE Computer Society Press, 1990.
Symbolic Systems, Explicit Properties: on Hybrid.. - Sebastiani, Tonetta.. (Correct)
No context found.
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic Model Checking: 10 20 States and Beyond. Information and Computation, 98(2):142--170, 1992.
Model Checking for Database Theoreticians - Moshe Vardi Rice (Correct)
No context found.
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 10 20 states and beyond. Information and Computation, 98(2):142--170, June 1992.
On Relational Analysis of Algebraic Datatypes - Kuncak, Jackson (Correct)
No context found.
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic Model Checking: 10 20 States and Beyond. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pages 1-- 33, Washington, D.C., 1990. IEEE Computer Society Press.
A Tool For Specification And Verification Of Epistemic.. - Raimondi, Lomuscio (2004) (3 citations) (Correct)
No context found.
J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 10 20 states and beyond. Information and Computation, 98(2):142--170, June 1992.
From Discrete Duration Calculus to Symbolic Automata - Gonnord, Halbwachs, Raymond (2004) (1 citation) (Correct)
No context found.
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and J. Hwang. Symbolic model checking: 10 20 states and beyond. In Fifth IEEE Symposium on Logic in Computer Science, Philadelphia, pages 428--439, June 1990.
Symbolic Model Checking of Multi-Agent Systems Using OBDDs - Raimondi, Lomuscio (Correct)
No context found.
J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 10 20 states and beyond. Information and Computation, 98(2):142-170, June 1992.
Verification In Multi-Agent Systems - Raimondi (Correct)
No context found.
J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 10 states and beyond. Information and Computation, 98(2):142-170, June 1992.
Formal Analysis of Early Requirements Specifications - Fuxman (2001) (6 citations) (Correct)
No context found.
J. Burch, E. Clarke, K. McMillan, D. Dill, and L. Hwang. Symbolic model checking: 10 20 states and beyond. Information and Computation, 98(2):142-- 170, June 1992.
A Decomposed Symbolic Approach to Reactive - Planning Seung Chung (2003) (Correct)
No context found.
Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang:, L.J.: Symbolic Model Checking: 10 20 States and Beyond. Information and Computation 98 (1992) 142--170
First 50 documents Next 50
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