Automated assume-guarantee reasoning through implicit learning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6174 LNCS, Issue , 2010, Pages 511-526

  Chen, Yu Fang ^a   Clarke, Edmund M ^b   Farzan, Azadeh ^c   Tsai, Ming Hsien ^d   Tsay, Yih Kuen ^d   Wang, Bow Yaw ^a,e,f  

^a ACADEMIA SINICA   (Taiwan)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c UNIVERSITY OF TORONTO   (Canada)

^d NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^e INRIA   (France)

^f TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ASSUME-GUARANTEE REASONING; IMPLICIT LEARNING; IMPLICIT REPRESENTATION; MODEL CHECKING ALGORITHM; TEST CASE;

AUTOMATA THEORY; BOOLEAN FUNCTIONS; COMPUTER AIDED ANALYSIS; MODEL CHECKING;

LEARNING ALGORITHMS;

EID: 77955003482     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14295-6_44     Document Type: Conference Paper

References (23)

1. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87-106 (1987)
2. Barringer, H., Giannakopoulou, D., Pǎsǎreanu, C.S.: Proof rules for automated compositional verification through learning. In: Workshop on Specification and Verification of Component-Based Systems, pp. 14-21 (2003)
3. Bobaru, M.G., Pǎsǎreanu, C.S., Giannakopoulou, D.: Automated assume-guarantee reasoning by abstraction refinement. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 135-148. Springer, Heidelberg (2008)
4. Bshouty, N.H.: Exact learning boolean function via the monotone theory. Information and Computation 123(1), 146-153 (1995)
5. Chaki, S., Clarke, E.M., Sinha, N., Thati, P.: Automated assume-guarantee reasoning for simulation conformance. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 534-547. Springer, Heidelberg (2005)
6. 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)
7. Chen, Y.F., Farzan, A., Clarke, E.M., Tsay, Y.K., Wang, B.Y.: Learning minimal separating DFA's for compositional verification. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 31-45. Springer, Heidelberg (2009)
8. Cimatti, A., Clarke, E., Giunchiglia, F., Roveri, M.: NuSMV: a new Symbolic Model Verifier. In: Halbwachs, N., Peled, D. (eds.) CAV 1999. LNCS, vol. 1633, pp. 495-499. Springer, Heidelberg (1999)
9. Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5), 752-794 (2003)
10. Cobleigh, J.M., Avrunin, G.S., Clarke, L.A.: Breaking up is hard to do: An evaluation of automated assume-guarantee reasoning. ACM Trans. Software Engineering Methodology 17(2) (2008)
11. Cobleigh, J.M., Giannakopoulou, D., Pǎsǎreanu, C.S.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 331-346. Springer, Heidelberg (2003)
12. 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: Ramakrishnan, C., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 2-17. Springer, Heidelberg (2008)
13. Gheorghiu, M., Giannakopoulou, D., Pǎsǎreanu, 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)
14. Giannakopoulou, D., Pǎsǎreanu, C.S.: Special issue on learning techniques for compositional reasoning. Formal Methods in System Design 32(3), 173-174 (2008)
15. Gupta, A., McMillan, K.L., Fu, Z.: Automated assumption generation for compositional verification. Formal Methods in System Design 32(3), 285-301 (2008)
16. Handy, J.: The Cache Memory Book. Academic Press, London (1998)
17. Jung, Y., Kong, S., Wang, B.Y., Yi, K.: Deriving invariants in propositional logic by algorithmic learning, decision procedure, and predicate abstraction. In: VMCAI. LNCS. Springer, Heidelberg (2010)
18. McMillan, K.L.: The SMV system, symbolic model checking - an approach. Technical Report CMU-CS-92-131, Carnegie Mellon University (1992)
19. McMillan, K.L.: Interpolation and SAT-based model checking. In: Hunt Jr., W.A.H., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 1-13. Springer, Heidelberg (2003)
20. Nam, W., Madhusudan, P., Alur, R.: Automatic symbolic compositional verification by learning assumptions. Formal Methods in System Design 32(3), 207-234 (2008)
21. Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. Information and Computation 103(2), 299-347 (1993)
22. Silberschatz, A., Galvin, P.B., Gagne, G.: Operating System Concepts, 7th edn. John Wiley & Sons, Inc., Chichester (2004)
23. 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)