{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T05:12:10Z","timestamp":1737263530476,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540712084"},{"type":"electronic","value":"9783540712091"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-71209-1_22","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T22:56:34Z","timestamp":1183589794000},"page":"276-291","source":"Crossref","is-referenced-by-count":25,"title":["Optimized L*-Based Assume-Guarantee Reasoning"],"prefix":"10.1007","author":[{"given":"Sagar","family":"Chaki","sequence":"first","affiliation":[]},{"given":"Ofer","family":"Strichman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","first-page":"331","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C.S. P\u0103s\u0103reanu","year":"2003","unstructured":"P\u0103s\u0103reanu, C.S., Giannakopoulou, D., Cobleigh, J.M.: Learning Assumptions for Compositional Verification. In: Garavel, H., Hatcliff, J. (eds.) ETAPS 2003 and TACAS 2003. LNCS, vol.\u00a02619, pp. 331\u2013346. Springer, Heidelberg (2003)"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Learning Regular Sets from Queries and Counterexamples. Information and Computation (2) (1987)","DOI":"10.1016\/0890-5401(87)90052-6"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","first-page":"164","volume-title":"Computer Aided Verification","author":"K. Wallnau","year":"2005","unstructured":"Wallnau, K., et al.: The ComFoRT Reasoning Framework. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 164\u2013169. Springer, Heidelberg (2005)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Rivest, R.L., Schapire, R.E.: Inference of Finite Automata Using Homing Sequences. Information and Computation (2) (1993)","DOI":"10.1006\/inco.1993.1021"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Peled, D., Vardi, M., Yannakakis, M.: Black box checking. In: Proc. of FORTE (1999)","DOI":"10.1007\/978-0-387-35578-8_13"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-36135-9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D.A. Peled","year":"2002","unstructured":"Peled, D.A., Yannakakis, M., Groce, A.: Adaptive Model Checking. In: Katoen, J.-P., Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol.\u00a02280, Springer, Heidelberg (2002)"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Alur, R., et al.: Synthesis of Interface Specifications for Java Classes. In: POPL (2005)","DOI":"10.1145\/1040305.1040314"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Habermehl, P., Vojnar, T.: Regular model checking using inference of regular languages. In: Proc. of INFINITY (2005)","DOI":"10.1016\/j.entcs.2005.01.044"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Ernst, M., et al.: Dynamically Discovering Likely Program Invariants to Support Program Evolution. In: Proc. of ICSE (1999)","DOI":"10.1145\/302405.302467"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1007\/11513988_52","volume-title":"Computer Aided Verification","author":"R. Alur","year":"2005","unstructured":"Alur, R., Madhusudan, P., Nam, W.: Symbolic Compositional Verification by Learning Assumptions. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 548\u2013562. Springer, Heidelberg (2005)"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","first-page":"534","volume-title":"Computer Aided Verification","author":"E. Clarke","year":"2005","unstructured":"Clarke, E., et al.: Automated Assume-Guarantee Reasoning for Simulation Conformance. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 534\u2013547. Springer, Heidelberg (2005)"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Chaki, S., Sinha, N.: Assume-guarantee reasoning for deadlock. In: Proc. of FMCAD (2006)","DOI":"10.1109\/FMCAD.2006.8"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Giannakopoulou, D.: Assumption Generation for Software Component Verification. In: Proc. of ASE (2002)","DOI":"10.1109\/ASE.2002.1114984"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: In Transition from Global to Modular Temporal Reasoning About Programs. In: Logics and Models of Concurrent Systems (1985)","DOI":"10.1007\/978-3-642-82453-1_5"},{"key":"22_CR15","volume-title":"Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach","author":"R. Kurshan","year":"1994","unstructured":"Kurshan, R.: Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, Princeton (1994)"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Clarke, E., et al.: Counterexample-Guided Abstraction Refinement for Symbolic Model Checking. Journal of the ACM (JACM) 50(5) (2003)","DOI":"10.1145\/876638.876643"},{"key":"22_CR17","unstructured":"Ball, T., Rajamani, S.: Generating Abstract Explanations of Spurious Counterexamples in C Programs. Technical Report MSR-TR-2002-09, Microsoft (2002)"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","first-page":"292","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C.S. P\u0103s\u0103reanu","year":"2007","unstructured":"P\u0103s\u0103reanu, C.S., Giannakopoulou, D., Gheorghiu, M.D.: Refining Interface Alphabets for Compositional Verification. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 292\u2013307. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71209-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T05:20:35Z","timestamp":1737177635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71209-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540712084","9783540712091"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71209-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}