{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:55:41Z","timestamp":1742399741096},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540238416"},{"type":"electronic","value":"9783540304821"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30482-1_23","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:27:38Z","timestamp":1267460858000},"page":"224-238","source":"Crossref","is-referenced-by-count":34,"title":["Counterexample Guided Abstraction Refinement Via Program Execution"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Kroening","sequence":"first","affiliation":[]},{"given":"Alex","family":"Groce","sequence":"additional","affiliation":[]},{"given":"Edmund","family":"Clarke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Ball, T.: Abstraction-guided test generation: A case study. Technical Report 2003-86, Microsoft Research (November 2003)"},{"key":"23_CR2","unstructured":"Ball, T.: A theory of predicate-complete test coverage and generation. Technical Report 2004-28, Microsoft Research (April 2004)"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-540-24730-2_30","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T. Ball","year":"2004","unstructured":"Ball, T., Cook, B., Das, S., Rajamani, S.K.: Refining approximations in software predicate abstraction. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 388\u2013403. Springer, Heidelberg (2004)"},{"key":"23_CR4","unstructured":"Ball, T., Rajamani, S.: Boolean programs: A model and process for software analysis. Technical Report 2000-14, Microsoft Research (February 2000)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Ball, T., Rajamani, S.: Automatically validating temporal safety properties of interfaces. In: SPIN Workshop on Model Checking of Software, pp. 103\u2013122 (2001)","DOI":"10.1007\/3-540-45139-0_7"},{"key":"23_CR6","unstructured":"Ball, T., Rajamani, S.: Generating abstract explanations of spurious counterexamples in C programs analysis. Technical Report 2002-09, Microsoft Research (January 2002)"},{"key":"23_CR7","unstructured":"Beyer, D., Chlipala, A., Henzinger, T., Jhala, R., Majumdar, R.: Generating tests from counterexamples. In: International Conference of Software Engineering (to appear, 2004)"},{"issue":"6","key":"23_CR8","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1109\/TSE.2004.22","volume":"30","author":"S. Chaki","year":"2004","unstructured":"Chaki, S., Clarke, E., Groce, A., Jha, S., Veith, H.: Modular verification of software components in C. IEEE Transactions on Software Engineering\u00a030(6), 388\u2013402 (2004)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Chaki, S., Clarke, E., Groce, A., Ouaknine, J., Strichman, O., Yorav, K.: Efficient verification of sequential and concurrent C programs. Formal Methods in System Design (to appear, 2004)","DOI":"10.1023\/B:FORM.0000040026.56959.91"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/3-540-45657-0_29","volume-title":"Computer Aided Verification","author":"A. Cimatti","year":"2002","unstructured":"Cimatti, A., Clarke, E., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV 2: An openSource tool for symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, p. 359. Springer, Heidelberg (2002)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Computer Aided Verification, pp. 154\u2013169 (2000)","DOI":"10.1007\/10722167_15"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Clarke, E., Grumberg, O., Long, D.: Model checking and abstraction. In: POPL (January 1992)","DOI":"10.1145\/143165.143235"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Clarke, E., Kroening, D., Sharygina, N., Yorav, K.: Predicate abstraction of ANSI-C programs using SAT. Formal Methods in System Design (to appear, 2004)","DOI":"10.21236\/ADA441311"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-24605-3_7","volume-title":"Theory and Applications of Satisfiability Testing","author":"E. Clarke","year":"2004","unstructured":"Clarke, E., Talupur, M., Veith, H., Wang, D.: SAT based predicate abstraction for hardware verification. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 78\u201392. Springer, Heidelberg (2004)"},{"key":"23_CR15","unstructured":"Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: A theorem prover for program checking. Technical Report HPL-2003-148, HP Labs (July 2003)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Godefroid, P.: VeriSoft: a tool for the automatic analysis of concurrent reactive software. In: Computer Aided Verification, pp. 172\u2013186 (1997)","DOI":"10.1007\/3-540-63166-6_52"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-63166-6_10","volume-title":"Computer Aided Verification","author":"S. Graf","year":"1997","unstructured":"Graf, S., Saidi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 72\u201383. Springer, Heidelberg (1997)"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: Principles of Programming Languages, pp. 58\u201370 (2002)","DOI":"10.1145\/565816.503279"},{"key":"23_CR19","volume-title":"MEMOCODE 2004","author":"H. Jain","year":"2004","unstructured":"Jain, H., Kroening, D., Clarke, E.: Verification of SpecC using Predicate Abstraction. In: MEMOCODE 2004. IEEE, Los Alamitos (2004)"},{"key":"23_CR20","doi-asserted-by":"crossref","DOI":"10.1515\/9781400864041","volume-title":"Computer-Aided Verification of Coordinating Processes: The Automata- Theoretic Approach","author":"R.P. Kurshan","year":"1995","unstructured":"Kurshan, R.P.: Computer-Aided Verification of Coordinating Processes: The Automata- Theoretic Approach. Princeton University Press, Princeton (1995)"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Musuvathi, M., Park, D., Chou, A., Engler, D., Dill, D.: CMC: a pragmatic approach to model checking real code. In: Symposium on Operating System Design and Implementation (2002)","DOI":"10.1145\/1060289.1060297"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Podelski, T.B.A., Rajamani, S.K.: Relative completeness of abstraction refinement for software model checking. In: Tools and Algorithms for the Construction and Analysis of Systems, pp. 158\u2013172 (2002)","DOI":"10.1007\/3-540-46002-0_12"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-540-24730-2_31","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Robby","year":"2004","unstructured":"Robby, Rodriguez, E., Dwyer, M., Hatcliff., J.: Checking strong specifications using an extensible software model checking framework. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 404\u2013420. Springer, Heidelberg (2004)"},{"issue":"2","key":"23_CR24","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/A:1022920129859","volume":"10","author":"W. Visser","year":"2003","unstructured":"Visser, W., Havelund, K., Brat, G., Park, S., Lerda, F.: Model checking programs. Automated Software Engineering\u00a010(2), 203\u2013232 (2003)","journal-title":"Automated Software Engineering"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30482-1_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:54:33Z","timestamp":1605761673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30482-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540238416","9783540304821"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30482-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}