The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
From program verification to program synthesis
Abstract
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier by allowing programs to be specified at a higher-level than executable code. In our approach, which we call proof-theoretic synthesis, the user provides an input-output functional specification, a description of the atomic operations in the programming language, and a specification of the synthesized program's looping structure, allowed stack space, and bound on usage of certain operations. Our technique synthesizes a program, if there exists one, that meets the input-output specification and uses only the given resources.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Cousot, P., & Cousot, R. (1977) · Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77 · doi:10.1145/512950.512973 · Cited by 6,279
Dijkstra, E. W. (1976) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,733
Guarded commands, nondeterminacy and formal derivation of programs
Dijkstra, E. W. (1975) · Communications of the ACM · doi:10.1145/360933.360975 · Cited by 1,941
Counterexample-Guided Abstraction Refinement
Clarke, E., Grumberg, O., Jha, S., Lu, Y., & Veith, H. (2000) · Lecture Notes in Computer Science · doi:10.1007/10722167_15 · Cited by 1,702
Gries, D. (1981) · Springer eBooks · doi:10.1007/978-1-4612-5983-1 · Cited by 1,433
On the synthesis of a reactive module
Pnueli, A., & Rosner, R. (1989) · Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89 · doi:10.1145/75277.75293 · Cited by 1,432
Interactive Theorem Proving and Program Development
Bertot, Y., & Castéran, P. (2004) · Texts in Theoretical Computer Science An EATCS Series · doi:10.1007/978-3-662-07964-5 · Cited by 1,353
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
Clarke, E. M., & Emerson, E. A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-69850-0_12 · Cited by 1,070
Predicate Calculus and Program Semantics
Dijkstra, E. W., & Schölten, C. S. (1990) · Springer eBooks · doi:10.1007/978-1-4612-3228-5 · Cited by 791
Henzinger, T. A., Jhala, R., Majumdar, R., & McMillan, K. L. (2014) · ACM SIGPLAN Notices · doi:10.1145/2641638.2641655 · Cited by 475
Linear Invariant Generation Using Non-linear Constraint Solving
Colón, M. A., Sankaranarayanan, S., & Sipma, H. B. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45069-6_39 · Cited by 351
Termination proofs for systems code
Cook, B., Podelski, A., & Rybalchenko, A. (2006) · ACM SIGPLAN Notices · doi:10.1145/1133255.1134029 · Cited by 317
Henzinger, T. A., Jhala, R., Majumdar, R., & McMillan, K. L. (2004) · Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/964001.964021 · Cited by 307
Toward automatic program synthesis
Manna, Z., & Waldinger, R. J. (1971) · Communications of the ACM · doi:10.1145/362566.362568 · Cited by 285
Termination proofs for systems code
Cook, B., Podelski, A., & Rybalchenko, A. (2006) · Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1133981.1134029 · Cited by 240
Jobstmann, B., Griesmayer, A., & Bloem, R. (2005) · Lecture Notes in Computer Science · doi:10.1007/11513988_23 · Cited by 223
Programming by sketching for bit-streaming programs
Solar-Lezama, A., Rabbah, R., Bodík, R., & Ebcioğlu, K. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065045 · Cited by 201
Program analysis as constraint solving
Gulwani, S., Srivastava, S., & Venkatesan, R. (2008) · Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1375581.1375616 · Cited by 199
Self-citationSketching concurrent data structures
Solar-Lezama, A., Jones, C. G., & Bodik, R. (2008) · Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1375581.1375599 · Cited by 195
Programming by sketching for bit-streaming programs
Solar-Lezama, A., Rabbah, R., Bodík, R., & Ebcioğlu, K. (2005) · Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation · doi:10.1145/1065010.1065045 · Cited by 195
Abstraction-guided synthesis of synchronization
Vechev, M., Yahav, E., & Yorsh, G. (2010) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1706299.1706338 · Cited by 156
Back to the future: revisiting precise program verification using SMT solvers
Lahiri, S. K., & Qadeer, S. (2008) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1328438.1328461 · Cited by 150
Solar-Lezama, A., Arnold, G., Tancau, L., Bodik, R., Saraswat, V., & Seshia, S. (2007) · Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1250734.1250754 · Cited by 149
Program verification using templates over predicate abstraction
Srivastava, S., & Gulwani, S. (2009) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1542476.1542501 · Cited by 118
Self-citationRepair of Boolean Programs with an Application to C
Griesmayer, A., Bloem, R., & Cook, B. (2006) · Lecture notes in computer science · doi:10.1007/11817963_33 · Cited by 72
Counterexample-guided abstraction refinement
Clarke, E. (2004) · International Symposium on Temporal Representation and Reasoning · doi:10.1109/time.2003.1214874 · Cited by 60
Constraint-Based Invariant Inference over Predicate Abstraction
Gulwani, S., Srivastava, S., & Venkatesan, R. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-93900-9_13 · Cited by 57
Self-citationInferring Synchronization under Limited Observability
Vechev, M., Yahav, E., & Yorsh, G. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00768-2_13 · Cited by 49
Synthesis of Programs in Computational Logic
Basin, D., Deville, Y., Flener, P., Hamfelt, A., & Nilsson, J. F. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25951-0_2 · Cited by 46
An Abstract Formalization of Correct Schemas for Program Synthesis
Flener, P., Lau, K.-K., Ornaghi, M., & Richardson, J. (2000) · Journal of Symbolic Computation · doi:10.1006/jsco.1999.0348 · Cited by 28
Schema-Guided Synthesis of Imperative Programs by Constraint Solving
Colón, M. A. (2005) · Lecture notes in computer science · doi:10.1007/11506676_11 · Cited by 15
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
Alur, R., Bodik, R., Juniwal, G., Martin, M. M. K., Raghothaman, M., Seshia, S. A., Singh, R., Solar-Lezama, A., Torlak, E., & Udupa, A. (2013) · 2013 Formal Methods in Computer-Aided Design · doi:10.1109/fmcad.2013.6679385 · Cited by 656
Automating string processing in spreadsheets using input-output examples
Gulwani, S. (2011) · ACM SIGPLAN Notices · doi:10.1145/1925844.1926423 · Cited by 581
Self-citationCode completion with statistical language models
Raychev, V., Vechev, M., & Yahav, E. (2014) · Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/2594291.2594321 · Cited by 555
Automating string processing in spreadsheets using input-output examples
Gulwani, S. (2011) · Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1926385.1926423 · Cited by 446
Self-citation
Metadata
- Authors
- Srivastava, S., Gulwani, S., & Foster, J. S.
- Venue
- Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
- Publisher
- ACM
- Published
- 2010-01-17
- Pages
- 313-326
- OpenAlex
- W2101432564
- Cited by
- 267
- References
- 32
- FWCI
- 25.47
- Type
- conference paper
- Language
- en
- Open access
- closed
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.