{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T20:57:38Z","timestamp":1774904258757,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T00:00:00Z","timestamp":1528675200000},"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":["CCF-1160904"],"award-info":[{"award-number":["CCF-1160904"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA84750-14-2-0006"],"award-info":[{"award-number":["FA84750-14-2-0006"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,11]]},"DOI":"10.1145\/3192366.3192383","type":"proceedings-article","created":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T08:16:01Z","timestamp":1528791361000},"page":"678-692","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Active learning of points-to specifications"],"prefix":"10.1145","author":[{"given":"Osbert","family":"Bastani","sequence":"first","affiliation":[{"name":"Stanford University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Sharma","sequence":"additional","affiliation":[{"name":"Microsoft Research, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Aiken","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Percy","family":"Liang","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6,11]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Aws Albarghouthi Isil Dillig and Arie Gurfinkel. 2016. Maximal specification synthesis. In POPL.   Aws Albarghouthi Isil Dillig and Arie Gurfinkel. 2016. Maximal specification synthesis. In POPL .","DOI":"10.1145\/2837614.2837628"},{"key":"e_1_3_2_2_2_1","volume-title":"Averroes: Whole-program analysis without the whole program. In ECOOP.","author":"Ali Karim","year":"2013","unstructured":"Karim Ali and Ondrej Lhot\u00e1k . 2013 . Averroes: Whole-program analysis without the whole program. In ECOOP. Karim Ali and Ondrej Lhot\u00e1k. 2013. Averroes: Whole-program analysis without the whole program. In ECOOP."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Rajeev Alur Pavol Cerny Parthasarathy Madhusudan and Wonhong Nam. 2005. Synthesis of interface specifications for Java classes. In POPL.   Rajeev Alur Pavol Cerny Parthasarathy Madhusudan and Wonhong Nam. 2005. Synthesis of interface specifications for Java classes. In POPL .","DOI":"10.1145\/1040305.1040314"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Glenn Ammons Rastislav Bod\u00edk and James R Larus. 2002. Mining specifications. In POPL.   Glenn Ammons Rastislav Bod\u00edk and James R Larus. 2002. Mining specifications. In POPL .","DOI":"10.1145\/503272.503275"},{"key":"e_1_3_2_2_6_1","volume-title":"Learning regular sets from queries and counterexamples. Information and computation","author":"Angluin Dana","year":"1987","unstructured":"Dana Angluin . 1987. Learning regular sets from queries and counterexamples. Information and computation ( 1987 ). Dana Angluin. 1987. Learning regular sets from queries and counterexamples. Information and computation (1987)."},{"key":"e_1_3_2_2_7_1","volume-title":"Damien Octeau, and Patrick McDaniel.","author":"Arzt Steven","year":"2014","unstructured":"Steven Arzt , Siegfried Rasthofer , Christian Fritz , Eric Bodden , Alexandre Bartel , Jacques Klein , Yves Le Traon , Damien Octeau, and Patrick McDaniel. 2014 . Flowdroid : Precise context, flow, field, object-sensitive and lifecycle-aware taint analysis for android apps. In PLDI. Steven Arzt, Siegfried Rasthofer, Christian Fritz, Eric Bodden, Alexandre Bartel, Jacques Klein, Yves Le Traon, Damien Octeau, and Patrick McDaniel. 2014. Flowdroid: Precise context, flow, field, object-sensitive and lifecycle-aware taint analysis for android apps. In PLDI."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Osbert Bastani Saswat Anand and Alex Aiken. 2015. Interactively verifying absence of explicit information flows in Android apps. In OOPSLA.   Osbert Bastani Saswat Anand and Alex Aiken. 2015. Interactively verifying absence of explicit information flows in Android apps. In OOPSLA .","DOI":"10.1145\/2814270.2814274"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Osbert Bastani Saswat Anand and Alex Aiken. 2015. Specification inference using context-free language reachability. In POPL.   Osbert Bastani Saswat Anand and Alex Aiken. 2015. Specification inference using context-free language reachability. In POPL .","DOI":"10.1145\/2676726.2676977"},{"key":"e_1_3_2_2_10_1","volume-title":"Eventually Sound Points-To Analysis with Missing Code. arXiv preprint arXiv:1711.03436","author":"Bastani Osbert","year":"2017","unstructured":"Osbert Bastani , Lazaro Clapp , Saswat Anand , Rahul Sharma , and Alex Aiken . 2017. Eventually Sound Points-To Analysis with Missing Code. arXiv preprint arXiv:1711.03436 ( 2017 ). Osbert Bastani, Lazaro Clapp, Saswat Anand, Rahul Sharma, and Alex Aiken. 2017. Eventually Sound Points-To Analysis with Missing Code. arXiv preprint arXiv:1711.03436 (2017)."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Osbert Bastani Rahul Sharma Alex Aiken and Percy Liang. 2017. Synthesizing program input grammars. In PLDI.   Osbert Bastani Rahul Sharma Alex Aiken and Percy Liang. 2017. Synthesizing program input grammars. In PLDI .","DOI":"10.1145\/3062341.3062349"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Nels E Beckman and Aditya V Nori. 2011. Probabilistic modular and scalable inference of typestate specifications. In PLDI.   Nels E Beckman and Aditya V Nori. 2011. Probabilistic modular and scalable inference of typestate specifications. In PLDI .","DOI":"10.1145\/1993498.1993524"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Lazaro Clapp Saswat Anand and Alex Aiken. 2015. Modelgen: mining explicit information flow specifications from concrete executions. In ISSTA.   Lazaro Clapp Saswat Anand and Alex Aiken. 2015. Modelgen: mining explicit information flow specifications from concrete executions. In ISSTA .","DOI":"10.1145\/2771783.2771810"},{"key":"e_1_3_2_2_14_1","unstructured":"Facebook. 2017. Adding models. (2017). http:\/\/fbinfer.com\/docs\/adding-models.html  Facebook. 2017. Adding models. (2017). http:\/\/fbinfer.com\/docs\/adding-models.html"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Manuel F\u00e4hndrich Jeffrey S Foster Zhendong Su and Alexander Aiken. 1998. Partial online cycle elimination in inclusion constraint graphs. In PLDI.   Manuel F\u00e4hndrich Jeffrey S Foster Zhendong Su and Alexander Aiken. 1998. Partial online cycle elimination in inclusion constraint graphs. In PLDI .","DOI":"10.1145\/277650.277667"},{"key":"e_1_3_2_2_16_1","volume-title":"Apposcopy: Semantics-based detection of android malware through static analysis. In FSE.","author":"Feng Yu","year":"2014","unstructured":"Yu Feng , Saswat Anand , Isil Dillig , and Alex Aiken . 2014 . Apposcopy: Semantics-based detection of android malware through static analysis. In FSE. Yu Feng, Saswat Anand, Isil Dillig, and Alex Aiken. 2014. Apposcopy: Semantics-based detection of android malware through static analysis. In FSE."},{"key":"e_1_3_2_2_17_1","volume-title":"Scandroid: Automated security certification of android.","author":"Fuchs Adam P","year":"2009","unstructured":"Adam P Fuchs , Avik Chaudhuri , and Jeffrey S Foster . 2009 . Scandroid: Automated security certification of android. (2009). Adam P Fuchs, Avik Chaudhuri, and Jeffrey S Foster. 2009. Scandroid: Automated security certification of android. (2009)."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Stefan Heule Eric Schkufza Rahul Sharma and Alex Aiken. 2016. Stratified synthesis: automatically learning the x86-64 instruction set. In PLDI.   Stefan Heule Eric Schkufza Rahul Sharma and Alex Aiken. 2016. Stratified synthesis: automatically learning the x86-64 instruction set. In PLDI .","DOI":"10.1145\/2908080.2908121"},{"key":"e_1_3_2_2_19_1","volume-title":"Mimic: Computing models for opaque code. In FSE.","author":"Heule Stefan","year":"2015","unstructured":"Stefan Heule , Manu Sridharan , and Satish Chandra . 2015 . Mimic: Computing models for opaque code. In FSE. Stefan Heule, Manu Sridharan, and Satish Chandra. 2015. Mimic: Computing models for opaque code. In FSE."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Jinseong Jeon Xiaokang Qiu Jonathan Fetter-Degges Jeffrey S Foster and Armando Solar-Lezama. 2016. Synthesizing framework models for symbolic execution. In ICSE.   Jinseong Jeon Xiaokang Qiu Jonathan Fetter-Degges Jeffrey S Foster and Armando Solar-Lezama. 2016. Synthesizing framework models for symbolic execution. In ICSE .","DOI":"10.1145\/2884781.2884856"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Levente Kocsis and Csaba Szepesv\u00e1ri. 2006. Bandit based monte-carlo planning. In ECML.   Levente Kocsis and Csaba Szepesv\u00e1ri. 2006. Bandit based monte-carlo planning. In ECML .","DOI":"10.1007\/11871842_29"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"John Kodumal and Alex Aiken. 2004. The set constraint\/CFL reachability connection in practice. In PLDI.   John Kodumal and Alex Aiken. 2004. The set constraint\/CFL reachability connection in practice. In PLDI .","DOI":"10.1145\/996841.996867"},{"key":"e_1_3_2_2_23_1","volume-title":"Banshee: A scalable constraint-based analysis toolkit. In SAS.","author":"Kodumal John","year":"2005","unstructured":"John Kodumal and Alexander Aiken . 2005 . Banshee: A scalable constraint-based analysis toolkit. In SAS. John Kodumal and Alexander Aiken. 2005. Banshee: A scalable constraint-based analysis toolkit. In SAS."},{"key":"e_1_3_2_2_24_1","unstructured":"Ted Kremenek Paul Twohey Godmar Back Andrew Ng and Dawson Engler. 2006. From uncertainty to belief: Inferring the specification within. In OSDI.   Ted Kremenek Paul Twohey Godmar Back Andrew Ng and Dawson Engler. 2006. From uncertainty to belief: Inferring the specification within. In OSDI ."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Percy Liang and Mayur Naik. 2011. Scaling abstraction refinement via pruning. In PLDI.   Percy Liang and Mayur Naik. 2011. Scaling abstraction refinement via pruning. In PLDI .","DOI":"10.1145\/1993498.1993567"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Benjamin Livshits Aditya V Nori Sriram K Rajamani and Anindya Banerjee. 2009. Merlin: specification inference for explicit information flow problems. In PLDI.   Benjamin Livshits Aditya V Nori Sriram K Rajamani and Anindya Banerjee. 2009. Merlin: specification inference for explicit information flow problems. In PLDI .","DOI":"10.1145\/1542476.1542485"},{"key":"e_1_3_2_2_27_1","volume-title":"Interconvertibility of a class of set constraints and context-free-language reachability. TCS","author":"Melski David","year":"2000","unstructured":"David Melski and Thomas Reps . 2000. Interconvertibility of a class of set constraints and context-free-language reachability. TCS ( 2000 ). David Melski and Thomas Reps. 2000. Interconvertibility of a class of set constraints and context-free-language reachability. TCS (2000)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Ana Milanova Atanas Rountev and Barbara G Ryder. 2002. Parameterized object sensitivity for points-to and side-effect analyses for Java. In ISSTA.   Ana Milanova Atanas Rountev and Barbara G Ryder. 2002. Parameterized object sensitivity for points-to and side-effect analyses for Java. In ISSTA .","DOI":"10.1145\/566172.566174"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Mayur Naik Alex Aiken and John Whaley. 2006. Effective static race detection for Java. In PLDI.   Mayur Naik Alex Aiken and John Whaley. 2006. Effective static race detection for Java. In PLDI .","DOI":"10.1145\/1133981.1134018"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Jeremy W Nimmer and Michael D Ernst. 2002. Automatic generation of program specifications. In ISSTA.   Jeremy W Nimmer and Michael D Ernst. 2002. Automatic generation of program specifications. In ISSTA .","DOI":"10.1145\/566172.566213"},{"key":"e_1_3_2_2_31_1","volume-title":"Identifying regular languages in polynomial time. Advances in Structural and Syntactic Pattern Recognition","author":"Oncina Jos\u00e9","year":"1992","unstructured":"Jos\u00e9 Oncina and Pedro Garc\u00eda . 1992. Identifying regular languages in polynomial time. Advances in Structural and Syntactic Pattern Recognition ( 1992 ). Jos\u00e9 Oncina and Pedro Garc\u00eda. 1992. Identifying regular languages in polynomial time. Advances in Structural and Syntactic Pattern Recognition (1992)."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Murali Krishna Ramanathan Ananth Grama and Suresh Jagannathan. 2007. Static specification inference using predicate mining. In PLDI.   Murali Krishna Ramanathan Ananth Grama and Suresh Jagannathan. 2007. Static specification inference using predicate mining. In PLDI .","DOI":"10.1145\/1250734.1250749"},{"key":"e_1_3_2_2_33_1","volume-title":"Program analysis via graph reachability. Information and software technology","author":"Reps Thomas","year":"1998","unstructured":"Thomas Reps . 1998. Program analysis via graph reachability. Information and software technology ( 1998 ). Thomas Reps. 1998. Program analysis via graph reachability. Information and software technology (1998)."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.806121"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Rahul Sharma and Alex Aiken. 2014. From invariant checking to invariant inference using randomized search. In CAV.   Rahul Sharma and Alex Aiken. 2014. From invariant checking to invariant inference using randomized search. In CAV .","DOI":"10.1007\/978-3-319-08867-9_6"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"crossref","unstructured":"Rahul Sharma Aditya V Nori and Alex Aiken. 2012. Interpolants as classifiers. In CAV.   Rahul Sharma Aditya V Nori and Alex Aiken. 2012. Interpolants as classifiers. In CAV .","DOI":"10.1007\/978-3-642-31424-7_11"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Rahul Sharma Eric Schkufza Berkeley Churchill and Alex Aiken. 2013. Data-driven equivalence checking. In OOPSLA.   Rahul Sharma Eric Schkufza Berkeley Churchill and Alex Aiken. 2013. Data-driven equivalence checking. In OOPSLA .","DOI":"10.1145\/2509136.2509509"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Sharon Shoham Eran Yahav Stephen Fink and Marco Pistoia. 2007. Static specification mining using automata-based abstractions. In ISSTA.   Sharon Shoham Eran Yahav Stephen Fink and Marco Pistoia. 2007. Static specification mining using automata-based abstractions. In ISSTA .","DOI":"10.1145\/1273463.1273487"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"Yannis Smaragdakis George Kastrinis and George Balatsouras. 2014. Introspective analysis: context-sensitivity across the board. In PLDI.   Yannis Smaragdakis George Kastrinis and George Balatsouras. 2014. Introspective analysis: context-sensitivity across the board. In PLDI .","DOI":"10.1145\/2594291.2594320"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"Manu Sridharan and Rastislav Bod\u00edk. 2006. Refinement-based context-sensitive points-to analysis for Java. In PLDI.   Manu Sridharan and Rastislav Bod\u00edk. 2006. Refinement-based context-sensitive points-to analysis for Java. In PLDI .","DOI":"10.1145\/1133981.1134027"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Manu Sridharan Denis Gopan Lexin Shan and Rastislav Bod\u00edk. 2005. Demand-driven points-to analysis for Java. In OOPSLA.   Manu Sridharan Denis Gopan Lexin Shan and Rastislav Bod\u00edk. 2005. Demand-driven points-to analysis for Java. In OOPSLA .","DOI":"10.1145\/1094811.1094817"},{"key":"e_1_3_2_2_43_1","unstructured":"Raja Vall\u00e9e-Rai Phong Co Etienne Gagnon Laurie Hendren Patrick Lam and Vijay Sundaresan. 1999. Soot-a Java bytecode optimization framework. In CASCON.   Raja Vall\u00e9e-Rai Phong Co Etienne Gagnon Laurie Hendren Patrick Lam and Vijay Sundaresan. 1999. Soot-a Java bytecode optimization framework. In CASCON ."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"crossref","unstructured":"John Whaley and Monica Lam. 2004. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In PLDI.   John Whaley and Monica Lam. 2004. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In PLDI .","DOI":"10.1145\/996841.996859"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Robert P Wilson and Monica S Lam. 1995. Efficient context-sensitive pointer analysis for C programs. In PLDI.   Robert P Wilson and Monica S Lam. 1995. Efficient context-sensitive pointer analysis for C programs. In PLDI .","DOI":"10.1145\/207110.207111"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"crossref","unstructured":"Jinlin Yang David Evans Deepali Bhardwaj Thirumalesh Bhat and Manuvir Das. 2006. Perracotta: mining temporal API rules from imperfect traces. In ICSE.   Jinlin Yang David Evans Deepali Bhardwaj Thirumalesh Bhat and Manuvir Das. 2006. Perracotta: mining temporal API rules from imperfect traces. In ICSE .","DOI":"10.1145\/1134285.1134325"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"crossref","unstructured":"Xin Zhang Ravi Mangal Radu Grigore Mayur Naik and Hongseok Yang. 2014. On abstraction refinement for program analyses in Datalog. In PLDI.   Xin Zhang Ravi Mangal Radu Grigore Mayur Naik and Hongseok Yang. 2014. On abstraction refinement for program analyses in Datalog. In PLDI .","DOI":"10.1145\/2594291.2594327"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"crossref","unstructured":"Haiyan Zhu Thomas Dillig and Isil Dillig. 2013. Automated inference of library specifications for source-sink property verification. In APLAS.   Haiyan Zhu Thomas Dillig and Isil Dillig. 2013. Automated inference of library specifications for source-sink property verification. In APLAS .","DOI":"10.1007\/978-3-319-03542-0_21"}],"event":{"name":"PLDI '18: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Philadelphia PA USA","acronym":"PLDI '18","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3192366.3192383","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3192366.3192383","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3192366.3192383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:07:53Z","timestamp":1750198073000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3192366.3192383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,11]]},"references-count":46,"alternative-id":["10.1145\/3192366.3192383","10.1145\/3192366"],"URL":"https:\/\/doi.org\/10.1145\/3192366.3192383","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3296979.3192383","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2018,6,11]]},"assertion":[{"value":"2018-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}