The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Combinatorial sketching for finite programs
Abstract
Sketching is a software synthesis approach where the programmer develops a partial implementation - a sketch - and a separate specification of the desired functionality. The synthesizer then completes the sketch to behave like the specification. The correctness of the synthesized implementation is guaranteed by the compiler, which allows, among other benefits, rapid development of highly tuned implementations without the fear of introducing bugs.We develop SKETCH, a language for finite programs with linguistic support for sketching. Finite programs include many highperformance kernels, including cryptocodes. In contrast to prior synthesizers, which had to be equipped with domain-specific rules, SKETCH completes sketches by means of a combinatorial search based on generalized boolean satisfiability. Consequently, our combinatorial synthesizer is complete for the class of finite programs: it is guaranteed to complete any sketch in theory, and in practice has scaled to realistic programming problems.Freed from domain rules, we can now write sketches as simpleto-understand partial programs, which are regular programs in which difficult code fragments are replaced with holes to be filled by the synthesizer. Holes may stand for index expressions, lookup tables, or bitmasks, but the programmer can easily define new kinds of holes using a single versatile synthesis operator.We have used SKETCH to synthesize an efficient implementation of the AES cipher standard. The synthesizer produces the most complex part of the implementation and runs in about an hour.
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
Eén, N., & Sörensson, N. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24605-3_37 · Cited by 2,629
A Transformation System for Developing Recursive Programs
Burstall, R. M., & Darlington, J. (1977) · Journal of the ACM · doi:10.1145/321992.321996 · Cited by 1,300
StreamIt: A Language for Streaming Applications
Thies, W., Karczmarek, M., & Amarasinghe, S. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45937-5_14 · Cited by 1,104
Combinatorial Algorithms: Theory and Practice
Reingold, E. M., Nievergelt, J., & Deo, N. (1977) · CERN Document Server (European Organization for Nuclear Research) · Cited by 905
DAG-aware AIG rewriting a fresh look at combinational logic synthesis
Mishchenko, A., Chatterjee, S., & Brayton, R. (2006) · Proceedings of the 43rd annual conference on Design automation - DAC '06 · doi:10.1145/1146909.1147048 · Cited by 490
Toward automatic program synthesis
Manna, Z., & Waldinger, R. J. (1971) · Communications of the ACM · doi:10.1145/362566.362568 · Cited by 285
Behavioral consistency of C and verilog programs using bounded model checking
Clarke, E., Kroening, D., & Yorav, K. (2003) · Proceedings of the 40th annual Design Automation Conference · doi:10.1145/775832.775928 · Cited by 281
(2013) · Choice Reviews Online · doi:10.5860/choice.50-5043 · Cited by 245
Combinatorial algorithms: Theory and practice
Cooper, L. (1978) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(78)90043-3 · Cited by 220
Scalable error detection using boolean satisfiability
Xie, Y., & Aiken, A. (2005) · Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1040305.1040334 · Cited by 213
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
Self-citationProgramming 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
Self-citationJoshi, R., Nelson, G., & Randall, K. H. (2002) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/512529.512566 · Cited by 149
Strategic directions in constraint programming
Hentenryck, P. V., & Saraswat, V. (1996) · CSUR · doi:10.1145/242223.242279 · Cited by 145
Self-citationProgrammable Reinforcement Learning Agents
André, D., & Russell, S. (2000) · Cited by 106
AutoBayes: a system for generating data analysis programs from statistical models
Fischer, B., & Schumann, J. M. P. (2003) · Journal of Functional Programming · doi:10.1017/s0956796802004562 · Cited by 105
Cited by
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
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
Oracle-guided component-based program synthesis
Jha, S., Gulwani, S., Seshia, S. A., & Tiwari, A. (2010) · Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1 · doi:10.1145/1806799.1806833 · Cited by 510
Self-citationSemFix: program repair via semantic analysis
Nguyen, H. D. T., Qi, D., Roychoudhury, A., & Chandra, S. (2013) · doi:10.5555/2486788.2486890 · Cited by 398
SemFix: Program repair via semantic analysis
Nguyen, H. D. T., Qi, D., Roychoudhury, A., & Chandra, S. (2013) · 2013 35th International Conference on Software Engineering (ICSE) · doi:10.1109/icse.2013.6606623 · Cited by 395
Metadata
- Authors
- Solar-Lezama, A., Tancau, L., Bodik, R., Seshia, S., & Saraswat, V.
- Venue
- Proceedings of the 12th international conference on Architectural support for programming languages and operating systems
- Publisher
- ACM
- Published
- 2006-10-20
- Pages
- 404-415
- OpenAlex
- W2149236697
- Cited by
- 635
- References
- 16
- FWCI
- 4.32
- 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.