-
1
-
-
84957669202
-
-
Springer-Verlag, Berlin, LNCS 1166
-
R.K. Brayton et al., VIS. In Formal Methods in Computer Aided Design, Springer-Verlag, Berlin, LNCS 1166, 1996, pp. 248-256.
-
(1996)
VIS. In Formal Methods in Computer Aided Design
, pp. 248-256
-
-
Brayton, R.K.1
-
2
-
-
84957058244
-
Efficient decision procedures for model checking of linear time logic properties
-
N. Halbwachs and D. Peled (Eds.), Springer-Verlag, Berlin, LNCS 1633
-
R. Bloem, K. Ravi, and F. Somenzi, "Efficient decision procedures for model checking of linear time logic properties," in N. Halbwachs and D. Peled (Eds.), Eleventh Conference on Computer Aided Verification (CAV'99), Springer-Verlag, Berlin, LNCS 1633, 1999, pp. 222-235,.
-
(1999)
Eleventh Conference on Computer Aided Verification (CAV'99)
, pp. 222-235
-
-
Bloem, R.1
Ravi, K.2
Somenzi, F.3
-
3
-
-
0022769976
-
Graph-based algorithms for Boolean function manipulation
-
R.E. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Transactions on Computers, vol. C-35, No. 8, pp. 677-691, 1986.
-
(1986)
IEEE Transactions on Computers
, vol.C-35
, Issue.8
, pp. 677-691
-
-
Bryant, R.E.1
-
4
-
-
0002921593
-
On a decision method in restricted second order arithmetic
-
Stanford University Press
-
J.R. Büchi, "On a decision method in restricted second order arithmetic," in Proceedings of the 1960 International Congress on Logic, Methodology, and Philosophy of Science, Stanford University Press, 1962, pp 1-11.
-
(1962)
Proceedings of the 1960 International Congress on Logic, Methodology, and Philosophy of Science
, pp. 1-11
-
-
Büchi, J.R.1
-
5
-
-
0022706656
-
Automatic verification of finite state concurrent systems using temporal logic specifications
-
E.M. Clarke, E.A. Emerson, and A.P. Sistla, "Automatic verification of finite state concurrent systems using temporal logic specifications," ACM Transaction on Programming Languages and Systems, Vol. 8, No. 2, pp. 244-263, 1986.
-
(1986)
ACM Transaction on Programming Languages and Systems
, vol.8
, Issue.2
, pp. 244-263
-
-
Clarke, E.M.1
Emerson, E.A.2
Sistla, A.P.3
-
6
-
-
0029238629
-
Efficient generation of counterexamples and witnesses in symbolic model checking
-
San Francisco, CA
-
E.M. Clarke, O. Grumberg, K. McMillan, and X. Zhao, "Efficient generation of counterexamples and witnesses in symbolic model checking," in Proceedings of the Design Automation Conference, San Francisco, CA, 1995, pp. 427-432.
-
(1995)
Proceedings of the Design Automation Conference
, pp. 427-432
-
-
Clarke, E.M.1
Grumberg, O.2
McMillan, K.3
Zhao, X.4
-
7
-
-
0003962322
-
-
MIT Press, Cambridge, MA
-
E.M. Clarke, O. Grumberg, and D.A. Peled, Model Checking, MIT Press, Cambridge, MA, 1999.
-
(1999)
Model Checking
-
-
Clarke, E.M.1
Grumberg, O.2
Peled, D.A.3
-
9
-
-
0023362541
-
Modalities for model checking: Branching time logic strikes back
-
E.A. Emerson and C. Lei, "Modalities for model checking: Branching time logic strikes back," Science of Computer Programming, Vol. 8, pp. 275-306, 1987.
-
(1987)
Science of Computer Programming
, vol.8
, pp. 275-306
-
-
Emerson, E.A.1
Lei, C.2
-
10
-
-
84976826635
-
An on-line edge-deletion problem
-
S. Even and Y. Shiloach, "An on-line edge-deletion problem," Journal of the Association for Computing Machinery, Vol. 28, No. 1, pp. 1-4, 1981.
-
(1981)
Journal of the Association for Computing Machinery
, vol.28
, Issue.1
, pp. 1-4
-
-
Even, S.1
Shiloach, Y.2
-
11
-
-
0037739919
-
Computing strongly connected componenets in a linear number of symbolic steps
-
Baltimore, MD
-
R. Gentilini, C. Piazza, and A. Policriti, "Computing strongly connected componenets in a linear number of symbolic steps, in Symposium on Discrete Algorithms, Baltimore, MD, 2003.
-
(2003)
Symposium on Discrete Algorithms
-
-
Gentilini, R.1
Piazza, C.2
Policriti, A.3
-
12
-
-
84949967077
-
COSPAN
-
T. Henzinger and R. Alur (Eds.), Springer-Verlag, Berlin, LNCS 1102
-
R.H. Hardin, Z. Har'El, and R.P. Kurshan, "COSPAN," in T. Henzinger and R. Alur (Eds.), Eighth Conference on Computer Aided Verification (CAV'96), Springer-Verlag, Berlin, LNCS 1102, 1996, pp. 423-427.
-
(1996)
Eighth Conference on Computer Aided Verification (CAV'96)
, pp. 423-427
-
-
Hardin, R.H.1
Har'El, Z.2
Kurshan, R.P.3
-
13
-
-
84947435279
-
A new heuristic for bad cycle detection using BDDs
-
O. Grumberg (Eds.), Springer-Verlag, Berlin, LNCS 1254
-
R.H. Hardin, R.P. Kurshan, S.K. Shukla, and M.Y. Vardi, "A new heuristic for bad cycle detection using BDDs," in O. Grumberg (Eds.), Ninth Conference on Computer Aided Verification (CAV'97), Springer-Verlag, Berlin, LNCS 1254, 1997, pp. 268-278.
-
(1997)
Ninth Conference on Computer Aided Verification (CAV'97)
, pp. 268-278
-
-
Hardin, R.H.1
Kurshan, R.P.2
Shukla, S.K.3
Vardi, M.Y.4
-
15
-
-
0027188883
-
A unified approach to language containment and fair CTL model checking
-
R. Hojati, T.R. Shiple, R. Brayton, and R. Kurshan, "A unified approach to language containment and fair CTL model checking," in Proceedings of the Design Automation Conference, 1993, pp. 475-481.
-
(1993)
Proceedings of the Design Automation Conference
, pp. 475-481
-
-
Hojati, R.1
Shiple, T.R.2
Brayton, R.3
Kurshan, R.4
-
16
-
-
84947926519
-
Faster algorithms for the nonemptiness of Streett automata and for communication protocol pruning
-
R. Karlsson and A. Lingas (Eds.), Springer-Verlag, Berlin, LNCS 1097
-
M.R. Henzinger and J.A. Telle, "Faster algorithms for the nonemptiness of Streett automata and for communication protocol pruning," in R. Karlsson and A. Lingas (Eds.), Algorithm Theory: SWAT'96, Springer-Verlag, Berlin, LNCS 1097, 1996, pp. 16-27.
-
(1996)
Algorithm Theory: SWAT'96
, pp. 16-27
-
-
Henzinger, M.R.1
Telle, J.A.2
-
17
-
-
32344432294
-
Efficient ω-regular language containment
-
Montréal, Canada
-
R. Hojati, H. Touati, R.P. Kurshan, and R. K. Brayton, "Efficient ω-regular language containment," in Computer Aided Verification, Montréal, Canada, 1992, pp. 371-382.
-
(1992)
Computer Aided Verification
, pp. 371-382
-
-
Hojati, R.1
Touati, H.2
Kurshan, R.P.3
Brayton, R.K.4
-
18
-
-
33745529429
-
Algorithmic verification of linear temporal logic specifications
-
Berlin, Springer, LNCS 1443
-
Y. Kesten, A. Pnueli, and L.-O. Raviv, "Algorithmic verification of linear temporal logic specifications," in International Colloquium on Automata, Languages, and Programming (ICALP-98), Berlin, Springer, LNCS 1443, 1998, pp. 1-16.
-
(1998)
International Colloquium on Automata, Languages, and Programming (ICALP-98)
, pp. 1-16
-
-
Kesten, Y.1
Pnueli, A.2
Raviv, L.-O.3
-
20
-
-
32344439754
-
Class project on BDD-based verification
-
E.M. Clarke
-
K. McMillan, "Class project on BDD-based verification," Private Communication, E.M. Clarke, 1987.
-
(1987)
Private Communication
-
-
McMillan, K.1
-
22
-
-
84958653356
-
Verification of infinite state systems by compositional model checking
-
Berlin, Springer-Verlag. LNCS 1703
-
K.L. McMillan, "Verification of infinite state systems by compositional model checking," in Correct Hardware Design and Verification Methods (CHARME'99), Berlin, Springer-Verlag. LNCS 1703, 1999, pp. 219-233.
-
(1999)
Correct Hardware Design and Verification Methods (CHARME'99)
, pp. 219-233
-
-
McMillan, K.L.1
-
23
-
-
84947265856
-
A comparative study of symbolic algorithms for the computation of fair cycles
-
W.A. Hunt, Jr. and S.D. Johnson (Eds.). Springer-Verlag, LNCS 1954
-
K. Ravi, R. Bloem, and F. Somenzi, "A comparative study of symbolic algorithms for the computation of fair cycles," in W.A. Hunt, Jr. and S.D. Johnson (Eds.). Formal Methods in Computer Aided Design, Springer-Verlag, LNCS 1954, 2000, pp. 143-160.
-
(2000)
Formal Methods in Computer Aided Design
, pp. 143-160
-
-
Ravi, K.1
Bloem, R.2
Somenzi, F.3
-
24
-
-
0000690591
-
Prepositional dynamic logic of looping and converse is elementarily decidable
-
R.S. Streett, "Prepositional dynamic logic of looping and converse is elementarily decidable," Information and Control, Vol. 54, pp. 121-141, 1982.
-
(1982)
Information and Control
, vol.54
, pp. 121-141
-
-
Streett, R.S.1
-
25
-
-
0001790593
-
Depth first search and linear graph algorithms
-
R. Tarjan, "Depth first search and linear graph algorithms," SIAM journal on Computing, Vol. 1, pp. 146-160, 1972.
-
(1972)
SIAM Journal on Computing
, vol.1
, pp. 146-160
-
-
Tarjan, R.1
-
26
-
-
0000666845
-
Testing language containment for ω-automata using BDD's
-
H.J. Touati, R.K. Brayton, and R.P. Kurshan, "Testing language containment for ω-automata using BDD's," Information and Computation, Vol. 118, No. 1, pp. 101-109, 1995.
-
(1995)
Information and Computation
, vol.118
, Issue.1
, pp. 101-109
-
-
Touati, H.J.1
Brayton, R.K.2
Kurshan, R.P.3
-
27
-
-
0033328172
-
Implicit enumeration of strongly connected components
-
San Jose, CA
-
A. Xie and P. A. Beerel, "Implicit enumeration of strongly connected components," in Proceedings of the International Conference on Computer-Aided Design, San Jose, CA, 1999, pp 37-40.
-
(1999)
Proceedings of the International Conference on Computer-aided Design
, pp. 37-40
-
-
Xie, A.1
Beerel, P.A.2
-
28
-
-
0034296833
-
Implicit enumeration of strongly connected components and an application to formal verification
-
A. Xie and P. A. Beerel, "Implicit enumeration of strongly connected components and an application to formal verification," IEEE Transactions on Computer-Aided Design, Vol. 19, No. 10, pp. 1225-1230, 2000.
-
(2000)
IEEE Transactions on Computer-aided Design
, vol.19
, Issue.10
, pp. 1225-1230
-
-
Xie, A.1
Beerel, P.A.2
|