The DOI matches its Crossref record; 38 of the 39 references it cites were found in a registry or an index.
Code completion with statistical language models
Abstract
We address the problem of synthesizing code completions for programs using APIs. Given a program with holes, we synthesize completions for holes with the most likely sequences of method calls.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Traditional code completion techniques typically involve analyzing code to identify potential suggestions, followed by re-ranking them”
From RepoCoder: Repository-Level Code Completion Through Iterative Retrieval and Generation (2023) · cites this paper as Raychev et al., 2014
In the citing paper
“While this approach offers efficient performance, it lacks the flexibility to generate code at arbitrary granularity.”
From RepoCoder: Repository-Level Code Completion Through Iterative Retrieval and Generation (2023) · cites this paper as Raychev et al., 2014
Citations
Cites
Elman, J. L. (1990) · Cognitive Science · doi:10.1207/s15516709cog1402_1 · Cited by 11,212
SRILM - an extensible language modeling toolkit
Stolcke, A. (2002) · 7th International Conference on Spoken Language Processing (ICSLP 2002) · doi:10.21437/icslp.2002-303 · Cited by 4,326
A neural probabilistic language model
BengioYoshua, DucharmeRéjean, VincentPascal, & JanvinChristian (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944966 · Cited by 2,644
Estimation of probabilities from sparse data for the language model component of a speech recognizer
Katz, S. (1987) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1987.1165125 · Cited by 1,637
Improved backing-off for M-gram language modeling
Kneser, R., & Ney, H. (2002) · 1995 International Conference on Acoustics, Speech, and Signal Processing · doi:10.1109/icassp.1995.479394 · Cited by 1,473
Points-to analysis in almost linear time
Steensgaard, B. (1996) · Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96 · doi:10.1145/237721.237727 · Cited by 1,088
Discovering models of software processes from event-based data
Cook, J. E., & Wolf, A. L. (1998) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/287000.287001 · Cited by 870
Two decades of statistical language modeling: where do we go from here?
Rosenfeld, R. (2000) · Proceedings of the IEEE · doi:10.1109/5.880083 · Cited by 735
Witten, I. H., & Bell, T. C. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.87000 · Cited by 729
Ammons, G., Bodík, R., & Larus, J. R. (2002) · Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/503272.503275 · Cited by 665
Combinatorial sketching for finite programs
Solar-Lezama, A., Tancau, L., Bodik, R., Seshia, S., & Saraswat, V. (2006) · Proceedings of the 12th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1168857.1168907 · Cited by 635
On the naturalness of software
Hindle, A., Barr, E. T., Su, Z., Gabel, M., & Dévanbu, P. (2012) · doi:10.5555/2337223.2337322 · Cited by 541
Strategies for training large scale neural network language models
Mikolov, T., Deoras, A., Povey, D., Burget, L., & Cernocky, J. (2011) · 2011 IEEE Workshop on Automatic Speech Recognition & Understanding · doi:10.1109/asru.2011.6163930 · Cited by 509
MAPO: Mining and Recommending API Usage Patterns
Zhong, H., Xie, T., Zhang, L., Pei, J., & Mei, H. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03013-0_15 · Cited by 410
Perracotta: mining temporal API rules from imperfect traces
Yang, J., Evans, D., Bhardwaj, D., Bhat, T., & Das, M. (2006) · Proceedings of the 28th international conference on Software engineering · doi:10.1145/1134285.1134325 · Cited by 406
Parseweb: a programmer assistant for reusing open source code on the web
Thummalapenta, S., & Xie, T. (2007) · Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering · doi:10.1145/1321631.1321663 · Cited by 391
Jungloid mining: helping to navigate the API jungle
Mandelin, D., Xu, L., Bodík, R., & Kimelman, D. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065018 · Cited by 388
Using structural context to recommend source code examples
Holmes, R., & Murphy, G. C. (2005) · Proceedings of the 27th international conference on Software engineering - ICSE '05 · doi:10.1145/1062455.1062491 · Cited by 379
Reiss, S. P. (2009) · 2009 IEEE 31st International Conference on Software Engineering · doi:10.1109/icse.2009.5070525 · Cited by 307
From program verification to program synthesis
Srivastava, S., Gulwani, S., & Foster, J. S. (2010) · Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1706299.1706337 · Cited by 267
Jungloid mining: helping to navigate the API jungle
Mandelin, D., Xu, L., Bodík, R., & Kimelman, D. (2005) · Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation · doi:10.1145/1065010.1065018 · Cited by 261
Mining Temporal Specifications for Error Detection
Weimer, W., & Necula, G. C. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31980-1_30 · Cited by 253
Dimensions in program synthesis
Gulwani, S. (2010) · Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming · doi:10.1145/1836089.1836091 · Cited by 238
Recurrent neural network based language modeling in meeting recognition
Kombrink, S., Mikolov, T., Karafiát, M., & Burget, L. (2011) · Interspeech 2011 · doi:10.21437/interspeech.2011-720 · Cited by 198
The Sketching Approach to Program Synthesis
Solar-Lezama, A. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10672-9_3 · Cited by 165
Static specification mining using automata-based abstractions
Shoham, S., Yahav, E., Fink, S. J., & Pistoia, M. (2007) · International Symposium on Software Testing and Analysis · doi:10.1145/1273463.1273487 · Cited by 157
Self-citationComplete completion using types and weights
Gvero, T., Kunčak, V., Kuraj, I., & Piskač, R. (2013) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2491956.2462192 · Cited by 146
Enabling static analysis for partial java programs
Dagenais, B., & Hendren, L. J. (2008) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/1449764.1449790 · Cited by 145
Type-directed completion of partial expressions
Perelman, D., Gulwani, S., Ball, T., & Grossman, D. (2012) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2254064.2254098 · Cited by 120
Mining Temporal Specifications from Object Usage
Wasylkowski, A., & Zeller, A. (2009) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase.2009.30 · Cited by 115
Deriving linearizable fine-grained concurrent objects
Vechev, M., & Yahav, E. (2008) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1375581.1375598 · Cited by 112
Self-citationTypestate-based semantic code search over partial programs
Mishne, A., Shoham, S., & Yahav, E. (2012) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/2384616.2384689 · Cited by 112
Self-citationStrathcona example recommendation tool
Holmes, R., Walker, R. J., & Murphy, G. C. (2005) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/1081706.1081744 · Cited by 88
Mining temporal specifications from object usage
Wasylkowski, A., & Zeller, A. (2011) · Automated Software Engineering · doi:10.1007/s10515-011-0084-1 · Cited by 67
An empirical study of object protocols in the wild
Beckman, N. E., Kim, D., & Aldrich, J. (2011) · KiltHub Repository · doi:10.5555/2032497.2032501 · Cited by 59
Interactive Synthesis of Code Snippets
Gvero, T., Kunčak, V., & Piskač, R. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22110-1_33 · Cited by 47
Data-driven synthesis for object-oriented frameworks
Yessenov, K., Xu, Z., & Solar-Lezama, A. (2011) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/2048066.2048075 · Cited by 23
Effective API navigation and reuse
Alnusair, A., Zhao, T. Q., & Bodden, E. (2010) · IEEE International Conference on Information Reuse and Integration (IRI) · doi:10.1109/iri.2010.5558972 · Cited by 20
Research works printed but not linked: 1
- Vallée-Rai , R. , Soot - a Java Optimization Framework. In Proceedings of CASCON 1999 ( 1999 ), pp. 125 -- 135 . Vallée-Rai, R., et al. Soot - a Java Optimization Framework. In Proceedings of CASCON 1999 (1999), pp. 125--135.
Cited by
Large Language Models for Software Engineering: A Systematic Literature Review
Hou, X., Zhao, Y., Liu, Y., Yang, Z., Wang, K., Li, L., Luo, X., Lo, D., Grundy, J., & Wang, H. (2024) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3695988 · Cited by 1,029
code2vec: Learning distributed representations of code
Alon, U., Zilberstein, M., Levy, O., & Yahav, E. (2019) · Proceedings of the ACM on Programming Languages · doi:10.1145/3290353 · Cited by 962
Self-citationAutomatically learning semantic features for defect prediction
Wang, S., Liu, T., & Tan, L. (2016) · Proceedings of the 38th International Conference on Software Engineering · doi:10.1145/2884781.2884804 · Cited by 689
A Novel Neural Source Code Representation Based on Abstract Syntax Tree
Zhang, J., Wang, X., Zhang, H., Sun, H., Wang, K., & Liu, X. (2019) · 2019 IEEE/ACM 41st International Conference on Software Engineering (ICSE) · doi:10.1109/icse.2019.00086 · Cited by 655
Deep learning code fragments for code clone detection
White, M., Tufano, M., Vendome, C., & Poshyvanyk, D. (2016) · Proceedings of the 31st IEEE/ACM International Conference on Automated Software Engineering · doi:10.1145/2970276.2970326 · Cited by 558
Metadata
- Authors
- Raychev, V., Vechev, M., & Yahav, E.
- Affiliations
- ETH Zurich (CH)
- Technion – Israel Institute of Technology (IL)
- Venue
- Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation
- Publisher
- ACM
- Published
- 2014-06-09
- Pages
- 419-428
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W2143861926
- Cited by
- 555
- References
- 39
- Citations by year
- 2026: 11 · 2025: 40 · 2024: 34 · 2023: 39 · 2022: 55 · 2021: 70 · 2020: 63 · 2019: 67 · 2018: 58 · 2017: 43 · 2016: 46 · 2015: 23 · 2014: 6
- FWCI
- 33.56
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Information Systems › Software Engineering Research
- Physical Sciences › Computer Science › Software › Software Testing and Debugging Techniques
- Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- Keywords
- code completion, statistical language models, program synthesis, method call sequences
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.