{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:06:16Z","timestamp":1767236776196,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T00:00:00Z","timestamp":1571616000000},"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":[[2019,10,21]]},"DOI":"10.1145\/3357765.3359518","type":"proceedings-article","created":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T18:52:21Z","timestamp":1570733541000},"page":"102-114","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Lifted static analysis using a binary decision diagram abstract domain"],"prefix":"10.1145","author":[{"given":"Aleksandar S.","family":"Dimovski","sequence":"first","affiliation":[{"name":"Mother Teresa University, Macedonia"}]}],"member":"320","published-online":{"date-parts":[[2019,10,21]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5381\/jot.2009.8.5.c5"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2486788.2486852"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2491976"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2554488.2554491"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"e_1_3_2_2_6_1","first-page":"319","volume-title":"21st Inter. Conference, FASE'18, Proceedings","volume":"10802","author":"Chechik M.","year":"2018","unstructured":"M. Chechik , I. Stavropoulou , C. Disenfeld , and J. Rubin . FPH: efficient non-commutativity analysis of feature-based systems. In Fundamental Approaches to Software Engineering , 21st Inter. Conference, FASE'18, Proceedings , volume 10802 of LNCS, pages 319 - 336 . Springer , 2018 . M. Chechik, I. Stavropoulou, C. Disenfeld, and J. Rubin. FPH: efficient non-commutativity analysis of feature-based systems. In Fundamental Approaches to Software Engineering, 21st Inter. Conference, FASE'18, Proceedings, volume 10802 of LNCS, pages 319-336. Springer, 2018."},{"key":"e_1_3_2_2_7_1","first-page":"36","volume-title":"SAS 2015, Proceedings","volume":"9291","author":"Chen J.","year":"2015","unstructured":"J. Chen and P. Cousot . A binary decision tree abstract domain functor. In Static Analysis - 22nd International Symposium , SAS 2015, Proceedings , volume 9291 of LNCS, pages 36 - 53 . Springer , 2015 . J. Chen and P. Cousot. A binary decision tree abstract domain functor. In Static Analysis - 22nd International Symposium, SAS 2015, Proceedings, volume 9291 of LNCS, pages 36-53. Springer, 2015."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(65)90045-5"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2012.86"},{"key":"e_1_3_2_2_10_1","volume-title":"Software Product Lines: Practices and Patterns","author":"Clements P.","year":"2001","unstructured":"P. Clements and L. Northrop . Software Product Lines: Practices and Patterns . Addison-Wesley , 2001 . P. Clements and L. Northrop. Software Product Lines: Practices and Patterns. Addison-Wesley, 2001."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/567752.567778"},{"key":"e_1_3_2_2_13_1","first-page":"21","volume-title":"14th European Symposium on Programming, ESOP 2005, Proceedings","volume":"3444","author":"Cousot P.","year":"2005","unstructured":"P. Cousot , R. Cousot , J. Feret , L. Mauborgne , A. Min\u00e9 , D. Monniaux , and X. Rival . The astre\u00e9 analyzer. In Programming Languages and Systems , 14th European Symposium on Programming, ESOP 2005, Proceedings , volume 3444 of LNCS, pages 21 - 30 . Springer , 2005 . P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Min\u00e9, D. Monniaux, and X. Rival. The astre\u00e9 analyzer. In Programming Languages and Systems, 14th European Symposium on Programming, ESOP 2005, Proceedings, volume 3444 of LNCS, pages 21-30. Springer, 2005."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1880443.1880448"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/512760.512770"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-016-0425-2"},{"key":"e_1_3_2_2_17_1","first-page":"247","volume-title":"29th European Conf. on Object-Oriented Programming, ECOOP 2015","volume":"37","author":"Dimovski A. S.","year":"2015","unstructured":"A. S. Dimovski , C. Brabrand , and A. Wasowski . Variability abstractions: Trading precision for speed in family-based analyses . In 29th European Conf. on Object-Oriented Programming, ECOOP 2015 , volume 37 of LIPIcs, pages 247 - 270 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik , 2015 . A. S. Dimovski, C. Brabrand, and A. Wasowski. Variability abstractions: Trading precision for speed in family-based analyses. In 29th European Conf. on Object-Oriented Programming, ECOOP 2015, volume 37 of LIPIcs, pages 247-270. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48989-6_14"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2017.12.012"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-019-00479-y"},{"key":"e_1_3_2_2_21_1","first-page":"192","volume-title":"FASE 2019, Proceedings","volume":"11424","author":"Dimovski A. S.","year":"2019","unstructured":"A. S. Dimovski , A. Legay , and A. Wasowski . Variability abstraction and refinement for game-based lifted model checking of full CTL. In Fundamental Approaches to Software Engineering - 22nd International Conference , FASE 2019, Proceedings , volume 11424 of LNCS, pages 192 - 209 . Springer , 2019 . A. S. Dimovski, A. Legay, and A. Wasowski. Variability abstraction and refinement for game-based lifted model checking of full CTL. In Fundamental Approaches to Software Engineering - 22nd International Conference, FASE 2019, Proceedings, volume 11424 of LNCS, pages 192- 209. Springer, 2019."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63121-9_13"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063239.2063245"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254103"},{"key":"e_1_3_2_2_25_1","first-page":"287","volume-title":"SAS 2010. Proceedings","volume":"6337","author":"Gurfinkel A.","year":"2010","unstructured":"A. Gurfinkel and S. Chaki . Boxes: A symbolic abstract domain of boxes. In Static Analysis - 17th International Symposium , SAS 2010. Proceedings , volume 6337 of LNCS, pages 287 - 303 . Springer , 2010 . A. Gurfinkel and S. Chaki. Boxes: A symbolic abstract domain of boxes. In Static Analysis - 17th International Symposium, SAS 2010. Proceedings, volume 6337 of LNCS, pages 287-303. Springer, 2010."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/975331"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2015.84"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SEFM.2009.29"},{"key":"e_1_3_2_2_29_1","first-page":"661","volume-title":"21st Inter. Conf., CAV'09.","volume":"5643","author":"Jeannet B.","year":"2009","unstructured":"B. Jeannet and A. Min\u00e9 . Apron: A library of numerical abstract domains for static analysis. In Computer Aided Verification , 21st Inter. Conf., CAV'09. , volume 5643 of LNCS, pages 661 - 667 . Springer , 2009 . B. Jeannet and A. Min\u00e9. Apron: A library of numerical abstract domains for static analysis. In Computer Aided Verification, 21st Inter. Conf., CAV'09., volume 5643 of LNCS, pages 661-667. Springer, 2009."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368088.1368131"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2970276.2970322"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2015.04.005"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-006-8609-1"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/555142"},{"key":"e_1_3_2_2_36_1","first-page":"233","volume-title":"SAS 2011. Proceedings","volume":"6887","author":"Schrammel P.","year":"2011","unstructured":"P. Schrammel and B. Jeannet . Logico-numerical abstract acceleration and application to the verification of data-flow programs. In Static Analysis - 18th International Symposium , SAS 2011. Proceedings , volume 6887 , pages 233 - 248 . Springer , 2011 . P. Schrammel and B. Jeannet. Logico-numerical abstract acceleration and application to the verification of data-flow programs. In Static Analysis - 18th International Symposium, SAS 2011. Proceedings, volume 6887, pages 233-248. Springer, 2011."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2580950"},{"key":"e_1_3_2_2_38_1","first-page":"302","volume-title":"SAS 2014. Proceedings","volume":"8723","author":"Urban C.","year":"2014","unstructured":"C. Urban and A. Min\u00e9 . A decision tree abstract domain for proving conditional termination. In Static Analysis - 21st International Symposium , SAS 2014. Proceedings , volume 8723 of LNCS, pages 302 - 318 . Springer , 2014 . C. Urban and A. Min\u00e9. A decision tree abstract domain for proving conditional termination. In Static Analysis - 21st International Symposium, SAS 2014. Proceedings, volume 8723 of LNCS, pages 302-318. Springer, 2014."}],"event":{"name":"GPCE '19: 18th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Athens Greece","acronym":"GPCE '19"},"container-title":["Proceedings of the 18th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357765.3359518","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357765.3359518","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:57Z","timestamp":1750199577000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357765.3359518"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,21]]},"references-count":37,"alternative-id":["10.1145\/3357765.3359518","10.1145\/3357765"],"URL":"https:\/\/doi.org\/10.1145\/3357765.3359518","relation":{},"subject":[],"published":{"date-parts":[[2019,10,21]]},"assertion":[{"value":"2019-10-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}