-
1
-
-
26444552036
-
-
Alur, R., Madhusudan, P., Nam, W.: Symbolic compositional verification by learning assumptions. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, 3576, pp. 548-562. Springer, Heidelberg (2005)
-
Alur, R., Madhusudan, P., Nam, W.: Symbolic compositional verification by learning assumptions. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 548-562. Springer, Heidelberg (2005)
-
-
-
-
2
-
-
0023453626
-
Learning regular sets from queries and counterexamples
-
Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87-106 (1987)
-
(1987)
Information and Computation
, vol.75
, Issue.2
, pp. 87-106
-
-
Angluin, D.1
-
3
-
-
0025449393
-
Negative results for equivalence queries
-
Angluin, D.: Negative results for equivalence queries. Machine Learning 5(2), 121-150 (1990)
-
(1990)
Machine Learning
, vol.5
, Issue.2
, pp. 121-150
-
-
Angluin, D.1
-
4
-
-
84869655580
-
-
Barringer, H., Giannakopoulou, D., Pǎšareanu, C.S.: Proof rules for automated compositional verification through learning. In: SAVCBS 2003, pp. 14-21 (2003)
-
Barringer, H., Giannakopoulou, D., Pǎšareanu, C.S.: Proof rules for automated compositional verification through learning. In: SAVCBS 2003, pp. 14-21 (2003)
-
-
-
-
5
-
-
26444584981
-
-
Chaki, S., Clarke, E.M., Sinha, N., Thati, P.: Dynamic component substitutability analysis. In: Fitzgerald, J.S., Hayes, I.J., Tarlecki, A. (eds.) FM 2005. LNCS, 3582, pp. 512-528. Springer, Heidelberg (2005)
-
Chaki, S., Clarke, E.M., Sinha, N., Thati, P.: Dynamic component substitutability analysis. In: Fitzgerald, J.S., Hayes, I.J., Tarlecki, A. (eds.) FM 2005. LNCS, vol. 3582, pp. 512-528. Springer, Heidelberg (2005)
-
-
-
-
6
-
-
37149000759
-
Optimized L*-based assume-guarantee reasoning
-
Grumberg, O, Huth, M, eds, TACAS 2007, Springer, Heidelberg
-
Chaki, S., Strichman, O.: Optimized L*-based assume-guarantee reasoning. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 276-291. Springer, Heidelberg (2007)
-
(2007)
LNCS
, vol.4424
, pp. 276-291
-
-
Chaki, S.1
Strichman, O.2
-
7
-
-
70350668314
-
-
Chen, Y.-F., Farzan, A., Clarke, E.M., Tsay, Y.-K.,Wang, B.-Y.: Learning minimal separating DFA's for compositional verification. Technical Report CMU-CS-09-101, Carnegie Mellon Univeristy (2009)
-
Chen, Y.-F., Farzan, A., Clarke, E.M., Tsay, Y.-K.,Wang, B.-Y.: Learning minimal separating DFA's for compositional verification. Technical Report CMU-CS-09-101, Carnegie Mellon Univeristy (2009)
-
-
-
-
8
-
-
0003962322
-
-
The MIT Press, Cambridge
-
Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)
-
(1999)
Model Checking
-
-
Clarke, E.M.1
Grumberg, O.2
Peled, D.A.3
-
9
-
-
43449095314
-
Breaking up is hard to do: An evaluation of automated assume-guarantee reasoning
-
Cobleigh, J.M., Avrunin, G.S., Clarke, L.A.: Breaking up is hard to do: An evaluation of automated assume-guarantee reasoning. ACM Transactions on Software Engineering and Methodology 7(2), 1-52 (2008)
-
(2008)
ACM Transactions on Software Engineering and Methodology
, vol.7
, Issue.2
, pp. 1-52
-
-
Cobleigh, J.M.1
Avrunin, G.S.2
Clarke, L.A.3
-
10
-
-
35248836944
-
-
Cobleigh, J.M., Giannakopoulou, D., P?as?areanu, C.S.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, 2619, pp. 331-346. Springer, Heidelberg (2003)
-
Cobleigh, J.M., Giannakopoulou, D., P?as?areanu, C.S.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 331-346. Springer, Heidelberg (2003)
-
-
-
-
11
-
-
47249127285
-
-
Farzan, A., Chen, Y.-F., Clarke, E.M., Tsay, Y.-K., Wang, B.-Y.: Extending automated compositional verification to the full class of omega-regular languages. In: Apolloni, B., Howlett, R.J., Jain, L. (eds.) KES 2007, Part II. LNCS, 4693, pp. 2-17. Springer, Heidelberg (2007)
-
Farzan, A., Chen, Y.-F., Clarke, E.M., Tsay, Y.-K., Wang, B.-Y.: Extending automated compositional verification to the full class of omega-regular languages. In: Apolloni, B., Howlett, R.J., Jain, L. (eds.) KES 2007, Part II. LNCS, vol. 4693, pp. 2-17. Springer, Heidelberg (2007)
-
-
-
-
12
-
-
37149051046
-
-
Gheorghiu, M., Giannakopoulou, D., P?as?areanu, C.S.: Refining interface alphabets for compositional verification. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, 4424, pp. 292-307. Springer, Heidelberg (2007)
-
Gheorghiu, M., Giannakopoulou, D., P?as?areanu, C.S.: Refining interface alphabets for compositional verification. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 292-307. Springer, Heidelberg (2007)
-
-
-
-
13
-
-
33749541721
-
-
Grinchtein, O., Leucker, M., Piterman, N.: Inferring network invariants automatically. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), 4130, pp. 483-497. Springer, Heidelberg (2006)
-
Grinchtein, O., Leucker, M., Piterman, N.: Inferring network invariants automatically. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 483-497. Springer, Heidelberg (2006)
-
-
-
-
14
-
-
38149082100
-
-
Gupta, A., McMillan, K.L., Fu, Z.: Automated assumption generation for compositional verification. In: Damm,W., Hermanns, H. (eds.) CAV 2007. LNCS, 4590, pp. 420-432. Springer, Heidelberg (2007)
-
Gupta, A., McMillan, K.L., Fu, Z.: Automated assumption generation for compositional verification. In: Damm,W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 420-432. Springer, Heidelberg (2007)
-
-
-
-
15
-
-
0004802505
-
Minimizing the number of states in incompletely specified sequential switching functions
-
Paull, M.C., Unger, S.H.: Minimizing the number of states in incompletely specified sequential switching functions. IRE Transitions on Electronic Computers EC-8, 356-366 (1959)
-
(1959)
IRE Transitions on Electronic Computers
, vol.EC-8
, pp. 356-366
-
-
Paull, M.C.1
Unger, S.H.2
-
16
-
-
0032317583
-
-
ICCAD, ACM Press, New York 1998
-
Pena, J.M., Oliveira, A.L.: A new algorithm for the reduction of incompletely specified finite state machines. In: ICCAD 1998, pp. 482-489. ACM Press, New York (1998)
-
(1998)
A new algorithm for the reduction of incompletely specified finite state machines
, pp. 482-489
-
-
Pena, J.M.1
Oliveira, A.L.2
-
17
-
-
0001349185
-
Inference of finite automata using homing sequences
-
Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. Information and Computation 103(2), 299-347 (1993)
-
(1993)
Information and Computation
, vol.103
, Issue.2
, pp. 299-347
-
-
Rivest, R.L.1
Schapire, R.E.2
-
18
-
-
38149031605
-
-
Sinha, N., Clarke, E.M.: SAT-based compositional verification using lazy learning. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, 4590, pp. 39-54. Springer, Heidelberg (2007)
-
Sinha, N., Clarke, E.M.: SAT-based compositional verification using lazy learning. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 39-54. Springer, Heidelberg (2007)
-
-
-
|