default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNadia Polikarpova
Person information
- affiliation: University of California, San Diego, Department of Computer Science and Engineering, CA, USA
- affiliation: Massachusetts Institute of Technology (MIT), CSAIL, Cambridge, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Ruyi Ji
, Yuwei Zhao, Nadia Polikarpova, Yingfei Xiong, Zhenjiang Hu:
Superfusion: Eliminating Intermediate Data Structures via Inductive Synthesis. Proc. ACM Program. Lang. 8(PLDI): 939-964 (2024)- [c32]Kasra Ferdowsi, Ruanqianqian (Lisa) Huang, Michael B. James, Nadia Polikarpova, Sorin Lerner:
Validating AI-Generated Code with Live Programming. CHI 2024: 143:1-143:8 - [c31]Shraddha Barke, Christian Pölitz, Carina Negreanu, Benjamin Zorn, José Cambronero, Andrew D. Gordon, Vu Le, Elnaz Nouri, Nadia Polikarpova, Advait Sarkar, Brian Slininger, Neil Toronto, Jack Williams:
Solving Data-centric Tasks using Large Language Models. NAACL-HLT (Findings) 2024: 626-638 - [i22]Shraddha Barke, Christian Pölitz, Carina Suzana Negreanu, Benjamin G. Zorn, José Cambronero, Andrew D. Gordon, Vu Le, Elnaz Nouri, Nadia Polikarpova, Advait Sarkar, Brian Slininger, Neil Toronto, Jack Williams:
Solving Data-centric Tasks using Large Language Models. CoRR abs/2402.11734 (2024) - [i21]Shraddha Barke, Emmanuel Anaya Gonzalez, Saketh Ram Kasibatla, Taylor Berg-Kirkpatrick, Nadia Polikarpova:
HYSYNTH: Context-Free LLM Approximation for Guiding Program Synthesis. CoRR abs/2405.15880 (2024) - [i20]Eric Mugnier, Emmanuel Anaya Gonzalez, Ranjit Jhala, Nadia Polikarpova, Yuanyuan Zhou:
Laurel: Generating Dafny Assertions Using Large Language Models. CoRR abs/2405.16792 (2024) - [i19]Kanghee Park, Jiayu Wang, Taylor Berg-Kirkpatrick, Nadia Polikarpova, Loris D'Antoni:
Grammar-Aligned Decoding. CoRR abs/2405.21047 (2024) - 2023
- [j16]Shraddha Barke, Michael B. James, Nadia Polikarpova:
Grounded Copilot: How Programmers Interact with Code-Generating Models. Proc. ACM Program. Lang. 7(OOPSLA1): 85-111 (2023) - [j15]Jonás Fiala, Shachar Itzhaky, Peter Müller, Nadia Polikarpova, Ilya Sergey:
Leveraging Rust Types for Program Synthesis. Proc. ACM Program. Lang. 7(PLDI): 1414-1437 (2023) - [j14]David Cao, Rose Kunkel, Chandrakana Nandi, Max Willsey, Zachary Tatlock, Nadia Polikarpova:
babble: Learning Better Abstractions with E-Graphs and Anti-unification. Proc. ACM Program. Lang. 7(POPL): 396-424 (2023) - [c30]Kasra Ferdowsi, Jack Williams, Ian Drosos, Andrew D. Gordon, Carina Negreanu, Nadia Polikarpova, Advait Sarkar, Benjamin Zorn:
COLDECO: An End User Spreadsheet Inspection Tool for AI-Generated Code. VL/HCC 2023: 82-91 - [i18]Kasra Ferdowsi, Ruanqianqian (Lisa) Huang, Michael B. James, Nadia Polikarpova, Sorin Lerner:
Live Exploration of AI-Generated Programs. CoRR abs/2306.09541 (2023) - 2022
- [j13]James Koppel, Zheng Guo, Edsko de Vries, Armando Solar-Lezama, Nadia Polikarpova:
Searching entangled program spaces. Proc. ACM Program. Lang. 6(ICFP): 23-51 (2022) - [c29]Zheng Guo, David Cao, Davin Tjong, Jean Yang, Cole Schlesinger, Nadia Polikarpova:
Type-directed program synthesis for RESTful APIs. PLDI 2022: 122-136 - [c28]Ivan Kuraj, Armando Solar-Lezama, Nadia Polikarpova:
Optimizing consistency for partially replicated data stores. PPoPP 2022: 457-458 - [e3]Nadia Polikarpova:
Haskell '22: 15th ACM SIGPLAN International Haskell Symposium, Ljubljana, Slovenia, September 15 - 16, 2022. ACM 2022, ISBN 978-1-4503-9438-3 [contents] - [i17]Zheng Guo, David Cao, Davin Tjong, Jean Yang, Cole Schlesinger, Nadia Polikarpova:
Type-Directed Program Synthesis for RESTful APIs. CoRR abs/2203.16697 (2022) - [i16]James Koppel, Zheng Guo, Edsko de Vries, Armando Solar-Lezama, Nadia Polikarpova:
Searching Entangled Program Spaces. CoRR abs/2206.07828 (2022) - [i15]Shraddha Barke, Michael B. James, Nadia Polikarpova:
Grounded Copilot: How Programmers Interact with Code-Generating Models. CoRR abs/2206.15000 (2022) - [i14]David Cao, Rose Kunkel, Chandrakana Nandi, Max Willsey, Zachary Tatlock, Nadia Polikarpova:
babble: Learning Better Abstractions with E-Graphs and Anti-Unification. CoRR abs/2212.04596 (2022) - 2021
- [j12]Yasunari Watanabe, Kiran Gopinathan, George Pîrlea, Nadia Polikarpova, Ilya Sergey:
Certifying the synthesis of heap-manipulating programs. Proc. ACM Program. Lang. 5(ICFP): 1-29 (2021) - [j11]Kasra Ferdowsifard, Shraddha Barke, Hila Peleg, Sorin Lerner, Nadia Polikarpova:
LooPy: interactive program synthesis with control structures. Proc. ACM Program. Lang. 5(OOPSLA): 1-29 (2021) - [j10]David Justo, Shaoqing Yi, Lukas Stadler, Nadia Polikarpova, Arun Kumar:
Towards A Polyglot Framework for Factorized ML. Proc. VLDB Endow. 14(12): 2918-2931 (2021) - [c27]Shachar Itzhaky, Hila Peleg, Nadia Polikarpova, Reuben N. S. Rowe, Ilya Sergey:
Deductive Synthesis of Programs with Pointers: Techniques, Challenges, Opportunities - (Invited Paper). CAV (1) 2021: 110-134 - [c26]Haoliang Wang, Nadia Polikarpova, Judith E. Fan:
Learning part-based abstractions for visual object concepts. CogSci 2021 - [c25]Haoliang Wang, Ed Vul, Nadia Polikarpova, Judith E. Fan:
Theory Acquisition as Constraint-Based Program Synthesis. CogSci 2021 - [c24]Nadia Polikarpova:
Synthesis of Safe Pointer-Manipulating Programs (Invited Talk). ITP 2021: 2:1-2:1 - [c23]Nico Lehmann, Rose Kunkel, Jordan Brown, Jean Yang, Niki Vazou, Nadia Polikarpova, Deian Stefan, Ranjit Jhala:
STORM: Refinement Types for Secure Web Applications. OSDI 2021: 441-459 - [c22]Shachar Itzhaky, Hila Peleg, Nadia Polikarpova, Reuben N. S. Rowe, Ilya Sergey:
Cyclic program synthesis. PLDI 2021: 944-959 - [c21]Dylan Lukes, John Sarracino, Cora Coleman, Hila Peleg, Sorin Lerner, Nadia Polikarpova:
Synthesis of web layouts from examples. ESEC/SIGSOFT FSE 2021: 651-663 - 2020
- [j9]Hila Peleg, Nadia Polikarpova:
Perfect is the Enemy of Good: Best-Effort Program Synthesis (Artifact). Dagstuhl Artifacts Ser. 6(2): 16:1-16:2 (2020) - [j8]Nadia Polikarpova, Deian Stefan, Jean Yang, Shachar Itzhaky, Travis Hance, Armando Solar-Lezama:
Liquid information flow control. Proc. ACM Program. Lang. 4(ICFP): 105:1-105:30 (2020) - [j7]Tristan Knoth, Di Wang, Adam Reynolds, Jan Hoffmann, Nadia Polikarpova:
Liquid resource types. Proc. ACM Program. Lang. 4(ICFP): 106:1-106:29 (2020) - [j6]Michael B. James, Zheng Guo, Ziteng Wang, Shivani Doshi, Hila Peleg, Ranjit Jhala, Nadia Polikarpova:
Digging for fold: synthesis-aided API discovery for Haskell. Proc. ACM Program. Lang. 4(OOPSLA): 205:1-205:27 (2020) - [j5]Shraddha Barke, Hila Peleg, Nadia Polikarpova:
Just-in-time learning for bottom-up enumerative synthesis. Proc. ACM Program. Lang. 4(OOPSLA): 227:1-227:29 (2020) - [j4]Zheng Guo, Michael James, David Justo, Jiaxiao Zhou, Ziteng Wang, Ranjit Jhala, Nadia Polikarpova:
Program synthesis by type-guided abstraction refinement. Proc. ACM Program. Lang. 4(POPL): 12:1-12:28 (2020) - [c20]Hila Peleg, Nadia Polikarpova:
Perfect Is the Enemy of Good: Best-Effort Program Synthesis. ECOOP 2020: 2:1-2:30 - [c19]Andreea Costea, Amy Zhu, Nadia Polikarpova, Ilya Sergey:
Concise Read-Only Specifications for Better Synthesis of Programs with Pointers. ESOP 2020: 141-168 - [c18]Kasra Ferdowsifard, Allen Ordookhanians, Hila Peleg, Sorin Lerner, Nadia Polikarpova:
Small-Step Live Programming by Example. UIST 2020: 614-626 - [e2]Maria Christakis, Nadia Polikarpova, Parasara Sridhar Duggirala, Peter Schrammel:
Software Verification - 12th International Conference, VSTTE 2020, and 13th International Workshop, NSV 2020, Los Angeles, CA, USA, July 20-21, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12549, Springer 2020, ISBN 978-3-030-63617-3 [contents] - [i13]Andreea Costea, Amy Zhu, Nadia Polikarpova, Ilya Sergey:
Concise Read-Only Specifications for Better Synthesis of Programs with Pointers - Extended Version. CoRR abs/2001.10723 (2020) - [i12]Tristan Knoth, Di Wang, Adam Reynolds, Jan Hoffmann, Nadia Polikarpova:
Liquid Resource Types. CoRR abs/2006.16233 (2020) - [i11]Shraddha Barke, Hila Peleg, Nadia Polikarpova:
Just-in-Time Learning for Bottom-Up Enumerative Synthesis. CoRR abs/2010.08663 (2020)
2010 – 2019
- 2019
- [j3]Nadia Polikarpova, Ilya Sergey:
Structuring the synthesis of heap-manipulating programs. Proc. ACM Program. Lang. 3(POPL): 72:1-72:30 (2019) - [c17]Shraddha Barke, Rose Kunkel, Nadia Polikarpova, Eric Meinhardt, Eric Bakovic, Leon Bergen:
Constraint-based Learning of Phonological Processes. EMNLP/IJCNLP (1) 2019: 6175-6185 - [c16]Nadia Polikarpova:
SuSLik: Synthesis of Safe Pointer-Manipulating Programs (Invited Tutorial). FMCAD 2019: 1 - [c15]Tristan Knoth, Di Wang, Nadia Polikarpova, Jan Hoffmann:
Resource-guided program synthesis. PLDI 2019: 253-268 - [i10]Tristan Knoth, Di Wang, Nadia Polikarpova, Jan Hoffmann:
Resource-Guided Program Synthesis. CoRR abs/1904.07415 (2019) - [i9]John Sarracino, Shraddha Barke, Nadia Polikarpova, Sorin Lerner:
Targeted Synthesis for Programming with Data Invariants. CoRR abs/1904.13049 (2019) - [i8]Zheng Guo, Michael James, David Justo, Jiaxiao Zhou, Ziteng Wang, Ranjit Jhala, Nadia Polikarpova:
Program Synthesis by Type-Guided Abstraction Refinement. CoRR abs/1911.04091 (2019) - 2018
- [j2]Nadia Polikarpova, Julian Tschannen, Carlo A. Furia:
A fully verified container library. Formal Aspects Comput. 30(5): 495-523 (2018) - [c14]Sourav Anand, Nadia Polikarpova:
Automatic Synchronization for GPU Kernels. FMCAD 2018: 1-9 - [i7]Nadia Polikarpova, Ilya Sergey:
Structuring the Synthesis of Heap-Manipulating Programs. CoRR abs/1807.07022 (2018) - 2017
- [j1]Carlo A. Furia, Martin Nordio, Nadia Polikarpova, Julian Tschannen:
AutoProof: auto-active functional verification of object-oriented programs. Int. J. Softw. Tools Technol. Transf. 19(6): 697-716 (2017) - [c13]Jeevana Priya Inala, Nadia Polikarpova, Xiaokang Qiu, Benjamin S. Lerner, Armando Solar-Lezama:
Synthesis of Recursive ADT Transformations from Reusable Templates. TACAS (1) 2017: 247-263 - [e1]Nadia Polikarpova, Steve A. Schneider:
Integrated Formal Methods - 13th International Conference, IFM 2017, Turin, Italy, September 20-22, 2017, Proceedings. Lecture Notes in Computer Science 10510, Springer 2017, ISBN 978-3-319-66844-4 [contents] - 2016
- [c12]Nadia Polikarpova, Ivan Kuraj, Armando Solar-Lezama:
Program synthesis from polymorphic refinement types. PLDI 2016: 522-538 - [i6]Nadia Polikarpova, Jean Yang, Shachar Itzhaky, Armando Solar-Lezama:
Type-Driven Repair for Information Flow Security. CoRR abs/1607.03445 (2016) - 2015
- [c11]Nadia Polikarpova, Julian Tschannen, Carlo A. Furia:
A Fully Verified Container Library. FM 2015: 414-434 - [c10]Julian Tschannen, Carlo A. Furia, Martin Nordio, Nadia Polikarpova:
AutoProof: Auto-Active Functional Verification of Object-Oriented Programs. TACAS 2015: 566-580 - [i5]Julian Tschannen, Carlo A. Furia, Martín Nordio, Nadia Polikarpova:
AutoProof: Auto-active Functional Verification of Object-oriented Programs. CoRR abs/1501.03063 (2015) - [i4]Nadia Polikarpova, Armando Solar-Lezama:
Program Synthesis from Polymorphic Refinement Types. CoRR abs/1510.08419 (2015) - 2014
- [b1]Nadia Polikarpova:
Specified and verified reusable components. ETH Zurich, Zürich, Switzerland, 2014 - [c9]Nadia Polikarpova, Julian Tschannen, Carlo A. Furia, Bertrand Meyer:
Flexible Invariants through Semantic Collaboration. FM 2014: 514-530 - 2013
- [c8]Nadia Polikarpova, Carlo A. Furia, Yu Pei, Yi Wei, Bertrand Meyer:
What good are strong specifications? ICSE 2013: 262-271 - [c7]Nadia Polikarpova, Carlo A. Furia, Scott West:
To Run What No One Has Run Before: Executing an Intermediate Verification Language. RV 2013: 251-268 - [c6]K. Rustan M. Leino, Nadia Polikarpova:
Verified Calculations. VSTTE 2013: 170-190 - [i3]Nadia Polikarpova, Julian Tschannen, Carlo A. Furia, Bertrand Meyer:
Flexible Invariants Through Semantic Collaboration. CoRR abs/1311.6329 (2013) - 2012
- [c5]Nadia Polikarpova, Michal Moskal:
Verifying Implementations of Security Protocols by Refinement. VSTTE 2012: 50-65 - [i2]Nadia Polikarpova, Carlo A. Furia, Yu Pei, Yi Wei, Bertrand Meyer:
What Good Are Strong Specifications? CoRR abs/1208.3337 (2012) - 2011
- [c4]Vladimir Klebanov, Peter Müller, Natarajan Shankar, Gary T. Leavens, Valentin Wüstholz, Eyad Alkassar, Rob Arthan, Derek Bronish, Rod Chapman, Ernie Cohen, Mark A. Hillebrand, Bart Jacobs, K. Rustan M. Leino, Rosemary Monahan, Frank Piessens, Nadia Polikarpova, Tom Ridge, Jan Smans, Stephan Tobies, Thomas Tuerk, Mattias Ulbrich, Benjamin Weiß:
The 1st Verified Software Competition: Experience Report. FM 2011: 154-168 - [c3]Thorsten Bormer, Marc Brockschmidt, Dino Distefano, Gidon Ernst, Jean-Christophe Filliâtre, Radu Grigore, Marieke Huisman, Vladimir Klebanov, Claude Marché, Rosemary Monahan, Wojciech Mostowski, Nadia Polikarpova, Christoph Scheben, Gerhard Schellhorn, Bogdan Tofan, Julian Tschannen, Mattias Ulbrich:
The COST IC0701 Verification Competition 2011. FoVeOOS 2011: 3-21 - 2010
- [c2]Nadia Polikarpova, Carlo A. Furia, Bertrand Meyer:
Specifying Reusable Components. VSTTE 2010: 127-141 - [i1]Nadia Polikarpova, Carlo A. Furia, Bertrand Meyer:
Specifying Reusable Components. CoRR abs/1003.5777 (2010)
2000 – 2009
- 2009
- [c1]Nadia Polikarpova, Ilinca Ciupa, Bertrand Meyer:
A comparative study of programmer-written and automatically inferred contracts. ISSTA 2009: 93-104
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
