{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:46Z","timestamp":1759638106528,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,11,11]],"date-time":"2014-11-11T00:00:00Z","timestamp":1415664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,11,11]]},"DOI":"10.1145\/2635868.2635919","type":"proceedings-article","created":{"date-parts":[[2014,11,4]],"date-time":"2014-11-04T21:44:36Z","timestamp":1415137476000},"page":"190-201","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Counterexample guided abstraction refinement of product-line behavioural models"],"prefix":"10.1145","author":[{"given":"Maxime","family":"Cordy","sequence":"first","affiliation":[{"name":"University of Namur, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Heymans","sequence":"additional","affiliation":[{"name":"University of Namur, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Axel","family":"Legay","sequence":"additional","affiliation":[{"name":"INRIA, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Yves","family":"Schobbens","sequence":"additional","affiliation":[{"name":"University of Namur, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Dawagne","sequence":"additional","affiliation":[{"name":"University of Namur, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Leucker","sequence":"additional","affiliation":[{"name":"University of L\u00fcbeck, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,11,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_48"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2011.6100075"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2486788.2486852"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SPLC.2011.34"},{"key":"e_1_3_2_1_5_1","volume-title":"Principles of Model Checking","author":"Baier C.","year":"2007","unstructured":"C. Baier and J.-P. Katoen . Principles of Model Checking . MIT Press , 2007 . C. Baier and J.-P. Katoen. Principles of Model Checking. MIT Press, 2007."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36742-7_43"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2032305.2032321"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1858996.1859064"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_26"},{"key":"e_1_3_2_1_10_1","first-page":"36","volume-title":"SPIN \u201901","author":"Chechik M.","year":"2001","unstructured":"M. Chechik , B. Devereux , and A. Gurfinkel . Model-checking infinite state-space systems with fine-grained abstractions using spin . In SPIN \u201901 , pages 16\u2013 36 , 2001 . M. Chechik, B. Devereux, and A. Gurfinkel. Model-checking infinite state-space systems with fine-grained abstractions using spin. In SPIN \u201901, pages 16\u201336, 2001."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/647769.734089"},{"key":"e_1_3_2_1_12_1","volume-title":"Model Checking","author":"Clarke E.","year":"1999","unstructured":"E. Clarke , O. Grumberg , and D. Peled . Model Checking . MIT Press , 1999 . E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:FORM.0000040025.89719.f3"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-012-0234-1"},{"key":"e_1_3_2_1_15_1","volume-title":"Snip: An efficient model checker for software product lines. Technical report","author":"Classen A.","year":"2011","unstructured":"A. Classen , M. Cordy , P. Heymans , P.-Y. Schobbens , and A. Legay . Snip: An efficient model checker for software product lines. Technical report , University of Namur (FUNDP) , 2011 . A. Classen, M. Cordy, P. Heymans, P.-Y. Schobbens, and A. Legay. Snip: An efficient model checker for software product lines. Technical report, University of Namur (FUNDP), 2011."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2012.86"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985838"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806799.1806850"},{"key":"e_1_3_2_1_19_1","volume-title":"Software Product Lines: Practices and Patterns. SEI Series in Software Engineering","author":"Clements P. C.","year":"2001","unstructured":"P. C. Clements and L. Northrop . Software Product Lines: Practices and Patterns. SEI Series in Software Engineering . Addison-Wesley , August 2001 . P. C. Clements and L. Northrop. Software Product Lines: Practices and Patterns. SEI Series in Software Engineering. Addison-Wesley, August 2001."},{"key":"e_1_3_2_1_20_1","volume-title":"NASA","author":"Consultative Committee for Space Data Systems (CCSDS).","year":"2007","unstructured":"Consultative Committee for Space Data Systems (CCSDS). CCSDS File Delivery Protocol (CFDP): Blue Book, Issue 4 . NASA , 2007 . Consultative Committee for Space Data Systems (CCSDS). CCSDS File Delivery Protocol (CFDP): Blue Book, Issue 4. NASA, 2007."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2110147.2110168"},{"key":"e_1_3_2_1_22_1","first-page":"682","volume-title":"ICSE\u201912","author":"Cordy M.","unstructured":"M. Cordy , A. Classen , G. Perrouin , P. Heymans , P.-Y. Schobbens , and A. Legay . Simulation-based abstractions for software product-line model checking . In ICSE\u201912 , pages 672\u2013 682 . IEEE, 2012. M. Cordy, A. Classen, G. Perrouin, P. Heymans, P.-Y. Schobbens, and A. Legay. Simulation-based abstractions for software product-line model checking. In ICSE\u201912, pages 672\u2013682. IEEE, 2012."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499777.2499781"},{"issue":"3","key":"e_1_3_2_1_24_1","first-page":"269","article-title":"Three Uses of the Herbrand-Gentzen Theorem","volume":"22","author":"Craig W.","year":"1957","unstructured":"W. Craig . Three Uses of the Herbrand-Gentzen Theorem in Relating Model Theory and Proof Theory. The Journal of Symbolic Logic , 22 ( 3 ): 269 \u2013 285 , 1957 . W. Craig. Three Uses of the Herbrand-Gentzen Theorem in Relating Model Theory and Proof Theory. The Journal of Symbolic Logic, 22(3):269\u2013285, 1957.","journal-title":"Relating Model Theory and Proof Theory. The Journal of Symbolic Logic"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2013.6693138"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1147249.1147254"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/647766.733618"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68863-1_8"},{"key":"e_1_3_2_1_29_1","volume-title":"The SPIN Model Checker: Primer and Reference Manual","author":"Holzmann G. J.","year":"2004","unstructured":"G. J. Holzmann . The SPIN Model Checker: Primer and Reference Manual . Addison-Wesley , 2004 . G. J. Holzmann. The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley, 2004."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1049\/ip-d.1983.0001"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2491437"},{"key":"e_1_3_2_1_33_1","volume-title":"Technical report","author":"Milner R.","year":"1971","unstructured":"R. Milner . An algebraic definition of simulation between programs. Technical report , Stanford University , Stanford, CA, USA , 1971 . R. Milner. An algebraic definition of simulation between programs. Technical report, Stanford University, Stanford, CA, USA, 1971."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36742-7_47"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(00)00018-6"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.32"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2008.45"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/RE.2006.23"}],"event":{"name":"SIGSOFT\/FSE'14: 22nd ACM SIGSOFT Symposium on the Foundations of Software Engineering","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"Hong Kong China","acronym":"SIGSOFT\/FSE'14"},"container-title":["Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2635868.2635919","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2635868.2635919","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:03:44Z","timestamp":1750273424000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2635868.2635919"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,11]]},"references-count":37,"alternative-id":["10.1145\/2635868.2635919","10.1145\/2635868"],"URL":"https:\/\/doi.org\/10.1145\/2635868.2635919","relation":{},"subject":[],"published":{"date-parts":[[2014,11,11]]},"assertion":[{"value":"2014-11-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}