{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T10:29:31Z","timestamp":1790936971276,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T00:00:00Z","timestamp":1565568000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["RF228-G1:5"],"award-info":[{"award-number":["RF228-G1:5"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007297","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-18-1-2037"],"award-info":[{"award-number":["N00014-18-1-2037"]}],"id":[{"id":"10.13039\/100007297","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,8,12]]},"DOI":"10.1145\/3338906.3338956","type":"proceedings-article","created":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T12:21:03Z","timestamp":1565353263000},"page":"556-566","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["Binary reduction of dependency graphs"],"prefix":"10.1145","author":[{"given":"Christian Gram","family":"Kalhauge","sequence":"first","affiliation":[{"name":"University of California at Los Angeles, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jens","family":"Palsberg","sequence":"additional","affiliation":[{"name":"University of California at Los Angeles, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,8,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/93548.93576"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/3220904.3221145"},{"key":"e_1_3_2_1_3_1","unstructured":"Lee Benfield. {n. d.}. CFR \u2013 another Java decompiler. ({n. d.}). http:\/\/www.benf. org\/other\/cfr\/ (accessed Aug 24 2018).  Lee Benfield. {n. d.}. CFR \u2013 another Java decompiler. ({n. d.}). http:\/\/www.benf. org\/other\/cfr\/ (accessed Aug 24 2018)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635893"},{"key":"e_1_3_2_1_5_1","unstructured":"Jong-Deok Choi and Andreas Zeller. 2002.  Jong-Deok Choi and Andreas Zeller. 2002."},{"key":"e_1_3_2_1_6_1","unstructured":"Isolating Failure-inducing Thread Schedules. In ISSTA.  Isolating Failure-inducing Thread Schedules. In ISSTA."},{"key":"e_1_3_2_1_7_1","volume-title":"Finding failure causes through automated testing. arXiv preprint cs\/0012009","author":"Cleve Holger","year":"2000"},{"key":"e_1_3_2_1_8_1","volume-title":"Sneaky Bugs and How to Find Them (with git bisect). Netguru (January","author":"Czajkowski Wiktor","year":"2018"},{"key":"e_1_3_2_1_9_1","volume-title":"d.}. Bisect. ({n. d.}). https:\/\/gitscm.com\/docs\/gitbisect (accessed","year":"2018"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.1574"},{"key":"e_1_3_2_1_11_1","unstructured":"Alex Groce Josie Holmes and Kevin Kellar. 2017.  Alex Groce Josie Holmes and Kevin Kellar. 2017."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3092703.3092704"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786805.2786846"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243838"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Christian Gram Kalhauge and Jens Palsberg. 2019. Artifact from \"Binary Reduction of Dependency Graphs\".  Christian Gram Kalhauge and Jens Palsberg. 2019. Artifact from \"Binary Reduction of Dependency Graphs\".","DOI":"10.1145\/3338906.3338956"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Christian Gram Kalhauge and Jens Palsberg. 2019. Results from \"Binary Reduction of Dependency Graphs\".  Christian Gram Kalhauge and Jens Palsberg. 2019. Results from \"Binary Reduction of Dependency Graphs\".","DOI":"10.1145\/3338906.3338956"},{"key":"e_1_3_2_1_17_1","volume-title":"Complexity of Computer Computations","author":"Karp Richard M."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321631.1321698"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2970276.2970336"},{"key":"e_1_3_2_1_20_1","unstructured":"S McPeak DS Wilkerson and S Goldsmith. 2015. Berkeley Delta.  S McPeak DS Wilkerson and S Goldsmith. 2015. Berkeley Delta."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134285.1134307"},{"key":"e_1_3_2_1_22_1","unstructured":"Jens Palsberg and Cristina Lopes. 2018.  Jens Palsberg and Cristina Lopes. 2018."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236454.3236501"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254104"},{"key":"e_1_3_2_1_25_1","volume-title":"d.}. Fernflower. ({n. d.}). https: \/\/github.com\/fesh0r\/fernflower (accessed","author":"Shevchenko Roman","year":"2018"},{"key":"e_1_3_2_1_26_1","volume-title":"d.}. Procyon Java Decompiler. ({n. d.}). https:\/\/bitbucket.org\/ mstrobel\/procyon\/overview (accessed","author":"Strobel Mike","year":"2018"},{"key":"e_1_3_2_1_27_1","unstructured":"Chengnian Sun Yuanbo Li Qirun Zhang Tianxiao Gu and Zhendong Su. 2018.  Chengnian Sun Yuanbo Li Qirun Zhang Tianxiao Gu and Zhendong Su. 2018."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3180155.3180236"},{"key":"e_1_3_2_1_29_1","unstructured":"Mark Weiser. 1981.  Mark Weiser. 1981."},{"key":"e_1_3_2_1_30_1","volume-title":"Proceedings of the 5th international conference on Software engineering","author":"Program"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2011.10.016"},{"key":"e_1_3_2_1_32_1","unstructured":"Andreas Zeller and Ralf Hildebrandt. 2002.  Andreas Zeller and Ralf Hildebrandt. 2002."},{"key":"e_1_3_2_1_33_1","unstructured":"Simplifying and Isolating Failure-Inducing Input. TSE (2002).  Simplifying and Isolating Failure-Inducing Input. TSE (2002)."}],"event":{"name":"ESEC\/FSE '19: 27th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering","location":"Tallinn Estonia","acronym":"ESEC\/FSE '19","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"]},"container-title":["Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3338906.3338956","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3338906.3338956","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3338906.3338956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:21Z","timestamp":1750206381000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3338906.3338956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,12]]},"references-count":33,"alternative-id":["10.1145\/3338906.3338956","10.1145\/3338906"],"URL":"https:\/\/doi.org\/10.1145\/3338906.3338956","relation":{},"subject":[],"published":{"date-parts":[[2019,8,12]]},"assertion":[{"value":"2019-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}