{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:22:46Z","timestamp":1765545766149,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,9,2]],"date-time":"2012-09-02T00:00:00Z","timestamp":1346544000000},"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":[[2012,9,2]]},"DOI":"10.1145\/2362536.2362553","type":"proceedings-article","created":{"date-parts":[[2012,9,12]],"date-time":"2012-09-12T13:01:27Z","timestamp":1347454887000},"page":"106-115","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["Efficient synthesis of feature models"],"prefix":"10.1145","author":[{"given":"Nele","family":"Andersen","sequence":"first","affiliation":[{"name":"IT University of Copenhagen, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Czarnecki","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"She","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"W\u0105sowski","sequence":"additional","affiliation":[{"name":"IT University of Copenhagen, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,9,2]]},"reference":[{"key":"e_1_3_2_1_2_1","volume-title":"Automatic synthesis of feature models based on satisfiability checking. Master's thesis","author":"Andersen N.","year":"2009","unstructured":"N. Andersen . Automatic synthesis of feature models based on satisfiability checking. Master's thesis , IT University of Copenhagen , 2009 . N. Andersen. Automatic synthesis of feature models based on satisfiability checking. Master's thesis, IT University of Copenhagen, 2009."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11554844_3"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2010.01.001"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1885639.1885698"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1858996.1859010"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/577427"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_1_9_1","volume-title":"Propositional Logic: Deduction and Algorithms","author":"B\u00fcning H. K.","year":"1999","unstructured":"H. K. B\u00fcning and T. Lettman . Propositional Logic: Deduction and Algorithms . Cambridge University Press , 1999 . H. K. B\u00fcning and T. Lettman. Propositional Logic: Deduction and Algorithms. Cambridge University Press, 1999."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033166"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806799.1806850"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/113938.113929"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094855.1094934"},{"key":"e_1_3_2_1_14_1","volume-title":"Generative Programming: Methods, Tools, and Applications","author":"Czarnecki K.","year":"2000","unstructured":"K. Czarnecki and U. W. Eisenecker . Generative Programming: Methods, Tools, and Applications . Addison-Wesley , Boston, MA , 2000 . K. Czarnecki and U. W. Eisenecker. Generative Programming: Methods, Tools, and Applications. Addison-Wesley, Boston, MA, 2000."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SPLC.2008.49"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1308171.1308185"},{"key":"e_1_3_2_1_17_1","author":"Dit B.","year":"2011","unstructured":"B. Dit , M. Revelle , M. Gethers , and D. Poshyvanyk . Feature location in source code: a taxonomy and survey. Journal of Software Maintenance and Evolution: Research and Practice , 2011 . B. Dit, M. Revelle, M. Gethers, and D. Poshyvanyk. Feature location in source code: a taxonomy and survey. Journal of Software Maintenance and Evolution: Research and Practice, 2011.","journal-title":"Journal of Software Maintenance and Evolution: Research and Practice"},{"key":"e_1_3_2_1_18_1","volume-title":"SAT","author":"E\u00e9n N.","year":"2003","unstructured":"N. E\u00e9n and N. S\u00f6rensson . An extensible SAT-solver . In SAT , LNCS. Springer , 2003 . N. E\u00e9n and N. S\u00f6rensson. An extensible SAT-solver. In SAT, LNCS. Springer, 2003."},{"key":"e_1_3_2_1_19_1","volume-title":"Australian Joint Conference on AI","author":"Errico B.","year":"1995","unstructured":"B. Errico , F. Pirri , and C. Pizzuti . Finding prime implicants by minimizing integer programming problems . In Australian Joint Conference on AI , 1995 . B. Errico, F. Pirri, and C. Pizzuti. Finding prime implicants by minimizing integer programming problems. In Australian Joint Conference on AI, 1995."},{"key":"e_1_3_2_1_20_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . W. H. Freeman & Co. , 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1979."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/551789.853486"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SPLC.2008.25"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1370175.1370199"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/648230.752787"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/648229.752318"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87875-9_31"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80029-6"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183236.1183270"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SPLINE.2007.31"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.1997.632261"},{"key":"e_1_3_2_1_32_1","volume-title":"SPLC '09","author":"Mendonca M.","year":"2009","unstructured":"M. Mendonca , A. W\u0105sowski , and K. Czarnecki . SAT-based analysis of feature models is easy . In SPLC '09 . IEEE, 2009 . M. Mendonca, A. W\u0105sowski, and K. Czarnecki. SAT-based analysis of feature models is easy. In SPLC '09. IEEE, 2009."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1449913.1449918"},{"key":"e_1_3_2_1_34_1","volume-title":"Common Variability Language RFP with ab changes","author":"OMG.","year":"2009","unstructured":"OMG. ad\/09-12-03. Common Variability Language RFP with ab changes , 2009 . OMG. ad\/09-12-03. Common Variability Language RFP with ab changes, 2009."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2019136.2019141"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1944892.1944907"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2006.08.008"},{"key":"e_1_3_2_1_38_1","volume-title":"VaMoS","author":"She S.","year":"2010","unstructured":"S. She , R. Lotufo , T. Berger , A. Wasowski , and K. Czarnecki . The variability model of the linux kernel . In VaMoS , 2010 . S. She, R. Lotufo, T. Berger, A. Wasowski, and K. Czarnecki. The variability model of the linux kernel. In VaMoS, 2010."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985856"},{"key":"e_1_3_2_1_40_1","volume-title":"International Workshop in Logic Synthesis","author":"Silva J. P. M.","year":"1997","unstructured":"J. P. M. Silva . On computing minimum size prime implicants . In International Workshop in Logic Synthesis , 1997 . J. P. M. Silva. On computing minimum size prime implicants. In International Workshop in Logic Synthesis, 1997."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/11527695_22"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/11499107_42"}],"event":{"name":"SPLC '12: 16th International Software Product Line Conference","sponsor":["Pure-Systems Pure-Systems GmbH","Petrobras Petr\u00f3leo Brasileiro S\/A","SEBRAE Servi\u00e7o Brasileiro de Apoio \u00e0s Micro E Pequenas Empresas","FAPESB Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado da Bahia","Hitachi","INES National Institute of Science and Technology for Software Engineering","IEEE Institute of Electrical and Electronics Engineers","Software Eng Inst Software Engineering Institute","Biglever BigLever Software, Inc.","CAPES Brazilian Higher Education Funding Council"],"location":"Salvador Brazil","acronym":"SPLC '12"},"container-title":["Proceedings of the 16th International Software Product Line Conference - Volume 1"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2362536.2362553","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2362536.2362553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:51Z","timestamp":1750239291000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2362536.2362553"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,2]]},"references-count":40,"alternative-id":["10.1145\/2362536.2362553","10.1145\/2362536"],"URL":"https:\/\/doi.org\/10.1145\/2362536.2362553","relation":{},"subject":[],"published":{"date-parts":[[2012,9,2]]},"assertion":[{"value":"2012-09-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}