{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T05:46:58Z","timestamp":1751348818318,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":92,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,21]],"date-time":"2017-08-21T00:00:00Z","timestamp":1503273600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1453386"],"award-info":[{"award-number":["1453386"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006602","name":"Air Force Research Laboratory","doi-asserted-by":"publisher","award":["FA8750-15-2-0096"],"award-info":[{"award-number":["FA8750-15-2-0096"]}],"id":[{"id":"10.13039\/100006602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,21]]},"DOI":"10.1145\/3106237.3106249","type":"proceedings-article","created":{"date-parts":[[2017,8,2]],"date-time":"2017-08-02T19:36:18Z","timestamp":1501702578000},"page":"174-185","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Failure-directed program trimming"],"prefix":"10.1145","author":[{"given":"Kostas","family":"Ferles","sequence":"first","affiliation":[{"name":"University of Texas at Austin, USA"}]},{"given":"Valentin","family":"W\u00fcstholz","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, USA"}]},{"given":"Maria","family":"Christakis","sequence":"additional","affiliation":[{"name":"University of Kent, UK"}]},{"given":"Isil","family":"Dillig","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,8,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/93542.93576"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1251535.1251543"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837628"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378846"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/604131.604140"},{"key":"e_1_3_2_1_6_1","volume-title":"Rajamani","author":"Ball Thomas","year":"2001","unstructured":"Thomas Ball and Sriram K . Rajamani . 2001 . The SLAM Toolkit. In CAV (LNCS), Vol. 2102 . Springer , 260\u2013264. Thomas Ball and Sriram K. Rajamani. 2001. The SLAM Toolkit. In CAV (LNCS), Vol. 2102. Springer, 260\u2013264."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503274"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11804192_17"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1953122.1953145"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1108792.1108813"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28756-5_38"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1296691.1296695"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2393596.2393664"},{"volume-title":"TACAS (LNCS)","author":"Biere Armin","key":"e_1_3_2_1_14_1","unstructured":"Armin Biere , Alessandro Cimatti , Edmund M. Clarke , and Yunshan Zhu . 1999. Symbolic Model Checking without BDDs . In TACAS (LNCS) , Vol. 1579 . Springer , 193\u2013207. Armin Biere, Alessandro Cimatti, Edmund M. Clarke, and Yunshan Zhu. 1999. Symbolic Model Checking without BDDs. In TACAS (LNCS), Vol. 1579. Springer, 193\u2013207."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60641-5"},{"volume-title":"VMCAI (LNCS)","author":"Bradley Aaron R.","key":"e_1_3_2_1_16_1","unstructured":"Aaron R. Bradley . 2011. SAT-Based Model Checking Without Unrolling . In VMCAI (LNCS) , Vol. 6538 . Springer , 70\u201387. Aaron R. Bradley. 2011. SAT-Based Model Checking Without Unrolling. In VMCAI (LNCS), Vol. 6538. Springer, 70\u201387."},{"key":"e_1_3_2_1_17_1","volume-title":"Engler","author":"Cadar Cristian","year":"2008","unstructured":"Cristian Cadar , Daniel Dunbar , and Dawson R . Engler . 2008 . KLEE : Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs. In OSDI. USENIX , 209\u2013224. Cristian Cadar, Daniel Dunbar, and Dawson R. Engler. 2008. KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs. In OSDI. USENIX, 209\u2013224."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11537328_2"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480917"},{"key":"e_1_3_2_1_20_1","first-page":"595","article-title":"Conditioned Program Slicing","volume":"40","author":"Canfora Gerardo","year":"1998","unstructured":"Gerardo Canfora , Aniello Cimitile , and Andrea de Lucia . 1998 . Conditioned Program Slicing . IST 40 (1998), 595 \u2013 607 . Issue 11\u201312. Gerardo Canfora, Aniello Cimitile, and Andrea de Lucia. 1998. Conditioned Program Slicing. IST 40 (1998), 595\u2013607. Issue 11\u201312.","journal-title":"IST"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542517"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2245276.2231980"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2014.10.006"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32759-9_13"},{"key":"e_1_3_2_1_26_1","unstructured":"Springer 132\u2013146.  Springer 132\u2013146."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884843"},{"volume-title":"SAS (LNCS)","author":"Christakis Maria","key":"e_1_3_2_1_28_1","unstructured":"Maria Christakis and Valentin W\u00fcstholz . 2016. Bounded Abstract Interpretation . In SAS (LNCS) , Vol. 9837 . Springer , 105\u2013125. Maria Christakis and Valentin W\u00fcstholz. 2016. Bounded Abstract Interpretation. In SAS (LNCS), Vol. 9837. Springer, 105\u2013125."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011276507260"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/647769.734089"},{"key":"e_1_3_2_1_31_1","unstructured":"Springer 154\u2013169.  Springer 154\u2013169."},{"key":"e_1_3_2_1_32_1","volume-title":"Hart","author":"Comuzzi Joseph J.","year":"1996","unstructured":"Joseph J. Comuzzi and Johnson M . Hart . 1996 . Program Slicing Using Weakest Preconditions. In FME (LNCS), Vol. 1051 . Springer , 557\u2013575. Joseph J. Comuzzi and Johnson M. Hart. 1996. Program Slicing Using Weakest Preconditions. In FME (LNCS), Vol. 1051. Springer, 557\u2013575."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35873-9_10"},{"key":"e_1_3_2_1_35_1","unstructured":"Springer 128\u2013148.  Springer 128\u2013148."},{"volume-title":"VMCAI (LNCS)","author":"Cousot Patrick","key":"e_1_3_2_1_36_1","unstructured":"Patrick Cousot , Radhia Cousot , and Francesco Logozzo . 2011. Precondition Inference from Intermittent Assertions and Application to Contracts on Collections . In VMCAI (LNCS) , Vol. 6538 . Springer , 150\u2013168. Patrick Cousot, Radhia Cousot, and Francesco Logozzo. 2011. Precondition Inference from Intermittent Assertions and Application to Contracts on Collections. In VMCAI (LNCS), Vol. 6538. Springer, 150\u2013168."},{"volume-title":"FASE (LNCS)","author":"Czech Mike","key":"e_1_3_2_1_37_1","unstructured":"Mike Czech , Marie-Christine Jakobs , and Heike Wehrheim . 2015. Just Test What You Cannot Verify! . In FASE (LNCS) , Vol. 9033 . Springer , 100\u2013114. Mike Czech, Marie-Christine Jakobs, and Heike Wehrheim. 2015. Just Test What You Cannot Verify!. In FASE (LNCS), Vol. 9033. Springer, 100\u2013114."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49122-5_16"},{"volume-title":"TACAS (LNCS)","author":"de Moura Leonardo","key":"e_1_3_2_1_39_1","unstructured":"Leonardo de Moura and Nikolaj Bj\u00f8rner . 2008. Z3: An Efficient SMT Solver . In TACAS (LNCS) , Vol. 4963 . Springer , 337\u2013340. Leonardo de Moura and Nikolaj Bj\u00f8rner. 2008. Z3: An Efficient SMT Solver. In TACAS (LNCS), Vol. 4963. Springer, 337\u2013340."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/360933.360975"},{"key":"e_1_3_2_1_41_1","volume-title":"Explain: A Tool for Performing Abductive Inference. In CAV (LNCS)","author":"Dillig Isil","year":"2013","unstructured":"Isil Dillig and Thomas Dillig . 2013 . Explain: A Tool for Performing Abductive Inference. In CAV (LNCS) , Vol. 8044 . Springer , 684\u2013689. Isil Dillig and Thomas Dillig. 2013. Explain: A Tool for Performing Abductive Inference. In CAV (LNCS), Vol. 8044. Springer, 684\u2013689."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375615"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11957-6_14"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926407"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2509136.2509511"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_32"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287653"},{"volume-title":"FoVeOOS (LNCS)","author":"F\u00e4hndrich Manuel","key":"e_1_3_2_1_48_1","unstructured":"Manuel F\u00e4hndrich and Francesco Logozzo . 2010. Static Contract Checking with Abstract Interpretation . In FoVeOOS (LNCS) , Vol. 6528 . Springer , 10\u201330. Manuel F\u00e4hndrich and Francesco Logozzo. 2010. Static Contract Checking with Abstract Interpretation. In FoVeOOS (LNCS), Vol. 6528. Springer, 10\u201330."},{"key":"e_1_3_2_1_49_1","volume-title":"Failure-Directed Program Trimming (Extended Version). CoRR abs\/1706.04468","author":"Ferles Kostas","year":"2017","unstructured":"Kostas Ferles , Valentin W\u00fcstholz , Maria Christakis , and Isil Dillig . 2017. Failure-Directed Program Trimming (Extended Version). CoRR abs\/1706.04468 ( 2017 ). Kostas Ferles, Valentin W\u00fcstholz, Maria Christakis, and Isil Dillig. 2017. Failure-Directed Program Trimming (Extended Version). CoRR abs\/1706.04468 (2017)."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199534"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512558"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49122-5_4"},{"key":"e_1_3_2_1_53_1","volume-title":"Stuckey","author":"Gange Graeme","year":"2016","unstructured":"Graeme Gange , Jorge A. Navas , Peter Schachte , Harald S\u00f8ndergaard , and Peter J . Stuckey . 2016 . Exploiting Sparsity in Difference-Bound Matrices. In SAS (LNCS), Vol. 9837 . Springer , 189\u2013211. Graeme Gange, Jorge A. Navas, Peter Schachte, Harald S\u00f8ndergaard, and Peter J. Stuckey. 2016. Exploiting Sparsity in Difference-Bound Matrices. In SAS (LNCS), Vol. 9837. Springer, 189\u2013211."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065036"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706307"},{"volume-title":"CAV (LNCS)","author":"Graf Susanne","key":"e_1_3_2_1_56_1","unstructured":"Susanne Graf and Hassen Sa\u00efdi . 1997. Construction of Abstract State Graphs with PVS . In CAV (LNCS) , Vol. 1254 . Springer , 72\u201383. Susanne Graf and Hassen Sa\u00efdi. 1997. Construction of Abstract State Graphs with PVS. In CAV (LNCS), Vol. 1254. Springer, 72\u201383."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88387-6_9"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2001.972724"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026599015809"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964021"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503279"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/363235.363259"},{"key":"e_1_3_2_1_63_1","series-title":"Lecture Notes in Mathematics","volume-title":"Symposium on Semantics of Algorithmic Languages","author":"Hoare C. A. R.","unstructured":"C. A. R. Hoare . 1971. Procedures and Parameters: An Axiomatic Approach . In Symposium on Semantics of Algorithmic Languages . Lecture Notes in Mathematics , Vol. 188 . Springer , 102\u2013116. C. A. R. Hoare. 1971. Procedures and Parameters: An Axiomatic Approach. In Symposium on Semantics of Algorithmic Languages. Lecture Notes in Mathematics, Vol. 188. Springer, 102\u2013116."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90106-2"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31612-8_13"},{"key":"e_1_3_2_1_66_1","volume-title":"CAV (LNCS)","author":"Ivancic Franjo","year":"2017","unstructured":"Franjo Ivancic , Zijiang Yang , Malay K. Ganai , Aarti Gupta , Ilya Shlyakhter , and Pranav Ashar . 2005. F-Soft: Software Verification Platform . In CAV (LNCS) , Vol. 3576 . Springer , 301\u2013306. ESEC\/FSE\u201917, September 4\u20138, 2017 , Paderborn, Germany Kostas Ferles, Valentin W\u00fcstholz, Maria Christakis, and Isil Dillig Franjo Ivancic, Zijiang Yang, Malay K. Ganai, Aarti Gupta, Ilya Shlyakhter, and Pranav Ashar. 2005. F-Soft: Software Verification Platform. In CAV (LNCS), Vol. 3576. Springer, 301\u2013306. ESEC\/FSE\u201917, September 4\u20138, 2017, Paderborn, Germany Kostas Ferles, Valentin W\u00fcstholz, Maria Christakis, and Isil Dillig"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635884"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065016"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360252"},{"volume-title":"A Program Transformation for Faster Goal-Directed Search","author":"Lal Akash","key":"e_1_3_2_1_70_1","unstructured":"Akash Lal and Shaz Qadeer . 2014. A Program Transformation for Faster Goal-Directed Search . In FMCAD. IEEE Computer Society , 147\u2013154. Akash Lal and Shaz Qadeer. 2014. A Program Transformation for Faster Goal-Directed Search. In FMCAD. IEEE Computer Society, 147\u2013154."},{"key":"e_1_3_2_1_71_1","volume-title":"Adve","author":"Lattner Chris","year":"2004","unstructured":"Chris Lattner and Vikram S . Adve . 2004 . LLVM : A Compilation Framework for Lifelong Program Analysis & Transformation. In CGO. IEEE Computer Society , 75\u201388. Chris Lattner and Vikram S. Adve. 2004. LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation. In CGO. IEEE Computer Society, 75\u201388."},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250766"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.10.015"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36742-7_26"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/2509136.2509553"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/2384616.2384626"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594326"},{"key":"e_1_3_2_1_78_1","volume-title":"Jeffrey S. Foster, and Michael Hicks.","author":"Ma Kin-Keung","year":"2011","unstructured":"Kin-Keung Ma , Yit Phang Khoo , Jeffrey S. Foster, and Michael Hicks. 2011 . Directed Symbolic Execution. In SAS (LNCS), Vol. 6887 . Springer , 95\u2013111. Kin-Keung Ma, Yit Phang Khoo, Jeffrey S. Foster, and Michael Hicks. 2011. Directed Symbolic Execution. In SAS (LNCS), Vol. 6887. Springer, 95\u2013111."},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1007\/s100090050041"},{"volume-title":"VMCAI (LNCS)","author":"Moy Yannick","key":"e_1_3_2_1_81_1","unstructured":"Yannick Moy . 2008. Sufficient Preconditions for Modular Assertion Checking . In VMCAI (LNCS) , Vol. 4905 . Springer , 188\u2013202. Yannick Moy. 2008. Sufficient Preconditions for Modular Assertion Checking. In VMCAI (LNCS), Vol. 4905. Springer, 188\u2013202."},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103701"},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00768-2_17"},{"key":"e_1_3_2_1_84_1","volume-title":"Two Approaches to Interprocedural Data Flow Analysis. Program Flow Analysis: Theory and Applications","author":"Pnueli Amir","year":"1981","unstructured":"Amir Pnueli and Micha Sharir . 1981. Two Approaches to Interprocedural Data Flow Analysis. Program Flow Analysis: Theory and Applications ( 1981 ), 189\u2013234. Amir Pnueli and Micha Sharir. 1981. Two Approaches to Interprocedural Data Flow Analysis. Program Flow Analysis: Theory and Applications (1981), 189\u2013234."},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49122-5_5"},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1109\/AST.2015.12"},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.5555\/2032305.2032362"},{"key":"e_1_3_2_1_88_1","unstructured":"Springer 703\u2013719.  Springer 703\u2013719."},{"key":"e_1_3_2_1_89_1","first-page":"121","article-title":"A Survey of Program Slicing Techniques","volume":"3","author":"Tip Frank","year":"1995","unstructured":"Frank Tip . 1995 . A Survey of Program Slicing Techniques . J. Prog. Lang. 3 (1995), 121 \u2013 189 . Issue 3. Frank Tip. 1995. A Survey of Program Slicing Techniques. J. Prog. Lang. 3 (1995), 121\u2013189. Issue 3.","journal-title":"J. Prog. Lang."},{"volume-title":"Program Slicing","author":"Weiser Mark","key":"e_1_3_2_1_90_1","unstructured":"Mark Weiser . 1981. Program Slicing . In ICSE. IEEE Computer Society , 439\u2013449. Mark Weiser. 1981. Program Slicing. In ICSE. IEEE Computer Society, 439\u2013449."},{"volume-title":"The Formal Semantics of Programming Languages: An Introduction","author":"Winskel Glynn","key":"e_1_3_2_1_91_1","unstructured":"Glynn Winskel . 2012. The Formal Semantics of Programming Languages: An Introduction . MIT Press . Glynn Winskel. 2012. The Formal Semantics of Programming Languages: An Introduction. MIT Press."},{"key":"e_1_3_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328467"},{"key":"e_1_3_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462185"},{"key":"e_1_3_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03542-0_21"}],"event":{"name":"ESEC\/FSE'17: Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"Paderborn Germany","acronym":"ESEC\/FSE'17"},"container-title":["Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3106237.3106249","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3106237.3106249","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3106237.3106249","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:36Z","timestamp":1750217436000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3106237.3106249"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,21]]},"references-count":92,"alternative-id":["10.1145\/3106237.3106249","10.1145\/3106237"],"URL":"https:\/\/doi.org\/10.1145\/3106237.3106249","relation":{},"subject":[],"published":{"date-parts":[[2017,8,21]]},"assertion":[{"value":"2017-08-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}