{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,4]],"date-time":"2026-11-04T18:03:29Z","timestamp":1793815409065,"version":"4.6.1"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"OOPSLA","license":[{"start":{"date-parts":[[2017,10,12]],"date-time":"2017-10-12T00:00:00Z","timestamp":1507766400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-15-2-0009"],"award-info":[{"award-number":["FA8750-15-2-0009"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1253867,1526270"],"award-info":[{"award-number":["1253867,1526270"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2017,10,12]]},"abstract":"<jats:p>We propose an interactive approach to resolve static analysis alarms. Our approach synergistically combines a sound but imprecise analysis with precise but unsound heuristics, through user interaction. In each iteration, it solves an optimization problem to find a set of questions for the user such that the expected payoff is maximized. We have implemented our approach in a tool, Ursa, that enables interactive alarm resolution for any analysis specified in the declarative logic programming language Datalog. We demonstrate the effectiveness of Ursa on a state-of-the-art static datarace analysis using a suite of 8 Java programs comprising 41-194 KLOC each. Ursa is able to eliminate 74% of the false alarms per benchmark with an average payoff of 12\u00d7 per question. Moreover, Ursa prioritizes user effort effectively by posing questions that yield high payoffs earlier.<\/jats:p>","DOI":"10.1145\/3133881","type":"journal-article","created":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T11:15:45Z","timestamp":1507893345000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["Effective interactive resolution of static analysis alarms"],"prefix":"10.1145","volume":"1","author":[{"given":"Xin","family":"Zhang","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Radu","family":"Grigore","sequence":"additional","affiliation":[{"name":"University of Kent, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xujie","family":"Si","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mayur","family":"Naik","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,10,12]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2015. UpWork. http:\/\/www.upwork.com . (2015). Accessed: 2015-11-19."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2008.130"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/604131.604140"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","unstructured":"Osbert Bastani Saswat Anand and Alex Aiken. 2015. Specification inference using context-free language reachability. In POPL . 10.1145\/2676726.2676977","DOI":"10.1145\/2676726.2676977"},{"key":"e_1_2_1_5_1","volume-title":"Benjamin Chelf, Andy Chou, Bryan Fulton, Seth Hallem, Charles-Henri Gros, Asya Kamsky, Scott McPeak, and Dawson R. Engler.","author":"Bessey Al","year":"2010","unstructured":"Al Bessey, Ken Block, Benjamin Chelf, Andy Chou, Bryan Fulton, Seth Hallem, Charles-Henri Gros, Asya Kamsky, Scott McPeak, and Dawson R. Engler. 2010. A few billion lines of code later: using static analysis to find bugs in the real world. Commun. ACM (2010)."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","unstructured":"Sam Blackshear and Shuvendu Lahiri. 2013. Almost-correct specifications: a modular semantic framework for assigning confidence to warnings. In PLDI. 10.1145\/2491956.2462188","DOI":"10.1145\/2491956.2462188"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Tom Copeland. 2005. PMD applied. (2005).","DOI":"10.1155\/IMRN.2005.1743"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","unstructured":"Isil Dillig Thomas Dillig and Alex Aiken. 2012. Automated error diagnosis using abductive inference. In PLDI. 10.1145\/2254064.2254087","DOI":"10.1145\/2254064.2254087"},{"key":"e_1_2_1_9_1","unstructured":"Lisa Nguyen Quang Do Karim Ali Benjamin Livshits Eric Bodden Justin Smith and Emerson Murphy-Hill. 2017. Just-intime static analysis. In ISSTA."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.908957"},{"key":"e_1_2_1_11_1","unstructured":"Gurobi Optimization Inc. 2016. Gurobi optimizer reference manual. http:\/\/www.gurobi.com . (2016)."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA419593"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1101908.1101949"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/581396.581397"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","unstructured":"Herbert Jordan Bernhard Scholz and Pavle Subotic. 2016. Souffl\u00e9: on synthesis of program analyzers. In CAV. 10.1007\/978-3-319-41540-6_23","DOI":"10.1007\/978-3-319-41540-6_23"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Yungbum Jung Jaehwang Kim Jaeho Shin and Kwangkeun Yi. 2005. Taming false alarms from a domain-unaware C analyzer by a bayesian statistical post analysis. In SAS.","DOI":"10.1007\/11547662_15"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","unstructured":"Ted Kremenek Ken Ashcraft Junfeng Yang and Dawson Engler. 2004. Correlation exploitation in error ranking. In FSE. 10.1145\/1029894.1029909","DOI":"10.1145\/1029894.1029909"},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Ted Kremenek and Dawson Engler. 2003. Z-Ranking: using statistical analysis to counter the impact of static analysis approximations. In SAS.","DOI":"10.1007\/3-540-44898-5_16"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","unstructured":"Wei Le and Mary Lou Soffa. 2010. Path-based Fault Correlations. In FSE. 10.1145\/1882291.1882336","DOI":"10.1145\/1882291.1882336"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","unstructured":"Woosuk Lee Wonchan Lee and Kwangkeun Yi. 2012. Sound non-statistical clustering of static analysis alarms. In VMCAI. 10.1007\/978-3-642-27940-9_20","DOI":"10.1007\/978-3-642-27940-9_20"},{"key":"e_1_2_1_21_1","volume-title":"Spark: A flexible points-to analysis framework for Java.","author":"Lhot\u00e1k Ondrej","year":"2002","unstructured":"Ondrej Lhot\u00e1k. 2002. Spark: A flexible points-to analysis framework for Java. (2002)."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065014"},{"key":"e_1_2_1_23_1","volume-title":"Bor-Yuh Evan Chang, Samuel Z. Guyer, Uday P. Khedker, Anders M\u00f8ller, and Dimitrios Vardoulakis.","author":"Livshits Benjamin","year":"2015","unstructured":"Benjamin Livshits, Manu Sridharan, Yannis Smaragdakis, Ondrej Lhot\u00e1k, Jos\u00e9 Nelson Amaral, Bor-Yuh Evan Chang, Samuel Z. Guyer, Uday P. Khedker, Anders M\u00f8ller, and Dimitrios Vardoulakis. 2015. In defense of soundiness: a manifesto. CACM (2015)."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","unstructured":"Magnus Madsen Ming-Ho Yee and Ondrej Lhot\u00e1k. 2016. From Datalog to Flix: a declarative language for fixed points on lattices. In PLDI. 10.1145\/2908080.2908096","DOI":"10.1145\/2908080.2908096"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","unstructured":"Ravi Mangal Xin Zhang Aditya V. Nori and Mayur Naik. 2015. A user-guided approach to program analysis. In FSE. 10.1145\/2786805.2786851","DOI":"10.1145\/2786805.2786851"},{"key":"e_1_2_1_26_1","volume-title":"Chord: A Program Analysis Platform for Java","author":"Naik Mayur","year":"2006","unstructured":"Mayur Naik. 2006. Chord: A Program Analysis Platform for Java. http:\/\/jchord.googlecode.com\/ . (2006)."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","unstructured":"Mayur Naik Alex Aiken and John Whaley. 2006. Effective static race detection for Java. In PLDI. 10.1145\/1133981.1134018","DOI":"10.1145\/1133981.1134018"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","unstructured":"Mayur Naik Hongseok Yang Ghila Castelnuovo and Mooly Sagiv. 2012. Abstractions from tests. In POPL. 10.1145\/2103656.2103701","DOI":"10.1145\/2103656.2103701"},{"key":"e_1_2_1_29_1","volume-title":"Oppen","author":"Nelson Greg","year":"1979","unstructured":"Greg Nelson and Derek C. Oppen. 1979. Simplification by cooperating decision procedures. ACM TOPLAS (1979)."},{"key":"e_1_2_1_30_1","volume-title":"Selective X-sensitive analysis guided by impact pre-analysis. ACM TOPLAS","author":"Oh Hakjoo","year":"2016","unstructured":"Hakjoo Oh, Wonchan Lee, Kihong Heo, Hongseok Yang, and Kwangkeun Yi. 2016. Selective X-sensitive analysis guided by impact pre-analysis. ACM TOPLAS (2016)."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","unstructured":"Oded Padon Kenneth McMillan Aurojit Panda Mooly Sagiv and Sharon Shoham. 2016. Ivy: safety verification by interactive generalization. In PLDI. 10.1145\/2908080.2908118","DOI":"10.1145\/2908080.2908118"},{"key":"e_1_2_1_32_1","volume-title":"On the complexity of integer programming. J. ACM","author":"Papadimitriou Christos H.","year":"1981","unstructured":"Christos H. Papadimitriou. 1981. On the complexity of integer programming. J. ACM (1981)."},{"key":"e_1_2_1_33_1","unstructured":"J. Ross Quinlan. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2003.1240292"},{"key":"e_1_2_1_35_1","unstructured":"Henry Gordon Rice. 1953. Classes of recursively enumerable sets and their decision problems. Trans. Amer. Math. Soc. (1953)."},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Yannis Smaragdakis and Martin Bravenboer. 2010. Using Datalog for fast and easy program analysis. In Datalog 2.0 Workshop .","DOI":"10.1007\/978-3-642-24206-9_14"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","unstructured":"Yannis Smaragdakis George Kastrinis and George Balatsouras. 2014. Introspective analysis: context-sensitivity across the board. In PLDI. 10.1145\/2666356.2594320","DOI":"10.1145\/2666356.2594320"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","unstructured":"Daniel von Dincklage and Amer Diwan. 2009. Optimizing programs with intended semantics. In OOPSLA. 10.1145\/1640089.1640120","DOI":"10.1145\/1640089.1640120"},{"key":"e_1_2_1_39_1","volume-title":"Pract. Exper.","author":"von Dincklage Daniel","year":"2011","unstructured":"Daniel von Dincklage and Amer Diwan. 2011. Integrating program analyses with programmer productivity tools. Softw., Pract. Exper. (2011)."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","unstructured":"Shiyi Wei Omer Tripp Barbara G. Ryder and Julian Dolby. 2016. Revamping JavaScript static analysis via localization and remediation of root causes of imprecision. In FSE. 10.1145\/2950290.2950338","DOI":"10.1145\/2950290.2950338"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/11575467_8"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","unstructured":"Xin Zhang Ravi Mangal Radu Grigore Mayur Naik and Hongseok Yang. 2014. On abstraction refinement for program analyses in Datalog. In PLDI. 10.1145\/2666356.2594327","DOI":"10.1145\/2666356.2594327"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03542-0_21"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133881","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133881","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133881","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,10]],"date-time":"2026-09-10T16:07:11Z","timestamp":1789056431000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133881"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,12]]},"references-count":43,"journal-issue":{"issue":"OOPSLA","published-print":{"date-parts":[[2017,10,12]]}},"alternative-id":["10.1145\/3133881"],"URL":"https:\/\/doi.org\/10.1145\/3133881","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,12]]},"assertion":[{"value":"2017-10-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}