{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:33:29Z","timestamp":1750221209178,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,9,10]],"date-time":"2018-09-10T00:00:00Z","timestamp":1536537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["01IS16042H"],"award-info":[{"award-number":["01IS16042H"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,9,10]]},"DOI":"10.1145\/3236405.3237202","type":"proceedings-article","created":{"date-parts":[[2018,9,4]],"date-time":"2018-09-04T12:38:13Z","timestamp":1536064693000},"page":"34-41","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Reverse engineering code dependencies"],"prefix":"10.1145","author":[{"given":"Adam","family":"Krafczyk","sequence":"first","affiliation":[{"name":"University of Hildesheim, Hildesheim, Germany"}]},{"given":"Sascha","family":"El-Sharkawy","sequence":"additional","affiliation":[{"name":"University of Hildesheim, Hildesheim, Germany"}]},{"given":"Klaus","family":"Schmid","sequence":"additional","affiliation":[{"name":"University of Hildesheim, Hildesheim, Germany"}]}],"member":"320","published-online":{"date-parts":[[2018,9,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Clark W. Barrett David L. Dill and Aaron Stump. 2002. Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT. In Computer Aided Verification Ed Brinksma and Kim Guldstrand Larsen (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 236--249.   Clark W. Barrett David L. Dill and Aaron Stump. 2002. Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT. In Computer Aided Verification Ed Brinksma and Kim Guldstrand Larsen (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 236--249.","DOI":"10.1007\/3-540-45657-0_18"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2013.34"},{"volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"de Moura Leonardo","key":"e_1_3_2_1_3_1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3233027.3233047"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3106195.3106208"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-015-9360-1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2048066.2048128"},{"key":"e_1_3_2_1_8_1","unstructured":"KernelHaven NonBooleanUtils 2018. https:\/\/github.com\/KernelHaven\/NonBooleanUtils Last visited: 22.05.2018.  KernelHaven NonBooleanUtils 2018. https:\/\/github.com\/KernelHaven\/NonBooleanUtils Last visited: 22.05.2018."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183440.3183480"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236405.3236410"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806799.1806819"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2015.2415793"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2019136.2019139"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1966445.1966451"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2580950"},{"key":"e_1_3_2_1_16_1","unstructured":"TypeChef 2013. https:\/\/ckaestne.github.io\/TypeChef\/ Last visited: 22.05.2018.  TypeChef 2013. https:\/\/ckaestne.github.io\/TypeChef\/ Last visited: 22.05.2018."},{"key":"e_1_3_2_1_17_1","unstructured":"Undertaker 2015. https:\/\/vamos.informatik.uni-erlangen.de\/trac\/undertaker Last visited: 22.05.2018.  Undertaker 2015. https:\/\/vamos.informatik.uni-erlangen.de\/trac\/undertaker Last visited: 22.05.2018."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Yingfei Xiong Hansheng Zhang Arnaud Hubaux Steven She Jie Wang and Krzysztof Czarnecki. 2015. Range fixes: Interactive error resolution for software configuration. Ieee transactions on software engineering 41 6 (2015) 603--619.  Yingfei Xiong Hansheng Zhang Arnaud Hubaux Steven She Jie Wang and Krzysztof Czarnecki. 2015. Range fixes: Interactive error resolution for software configuration. Ieee transactions on software engineering 41 6 (2015) 603--619.","DOI":"10.1109\/TSE.2014.2383381"}],"event":{"name":"SPLC '18: 22nd International Systems and Software Product Line Conference","acronym":"SPLC '18","location":"Gothenburg Sweden"},"container-title":["Proceedings of the 22nd International Systems and Software Product Line Conference - Volume 2"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3236405.3237202","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3236405.3237202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:39Z","timestamp":1750210779000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3236405.3237202"}},"subtitle":["converting integer-based variability to propositional logic"],"short-title":[],"issued":{"date-parts":[[2018,9,10]]},"references-count":18,"alternative-id":["10.1145\/3236405.3237202","10.1145\/3236405"],"URL":"https:\/\/doi.org\/10.1145\/3236405.3237202","relation":{},"subject":[],"published":{"date-parts":[[2018,9,10]]},"assertion":[{"value":"2018-09-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}