The DOI matches its Crossref record.
Automating string processing in spreadsheets using input-output examples
Abstract
We describe the design of a string programming/expression language that supports restricted forms of regular expressions, conditionals and loops. The language is expressive enough to represent a wide variety of string manipulation tasks that end-users struggle with. We describe an algorithm based on several novel concepts for synthesizing a desired program in this language from input-output examples. The synthesis algorithm is very efficient taking a fraction of a second for various benchmark examples. The synthesis algorithm is interactive and has several desirable features: it can rank multiple solutions and has fast convergence, it can detect noise in the user input, and it supports an active interaction model wherein the user is prompted to provide outputs on inputs that may have multiple computational interpretations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
No references could be resolved yet.
Research works printed but not linked: 23
- 10.1016/0890-5401(87)90052-6 · DOI · Paper page
- 10.1145/1065010.1065046 · DOI
- 10.1145/1111037.1111039 · DOI
- 10.1145/1328438.1328488 · DOI
- Gualtieri M., 2009, Forrester Report for Application Development and Program Management Professionals
- 10.1145/1836089.1836091 · DOI
- 10.1007/978-3-540-27864-1_17 · DOI
- 10.1145/1806799.1806833 · DOI · Paper page
- 10.1109/VLHCC.2004.47 · DOI · Paper page
- Lau T., 2008, CHI 2008 Workshop on Usable AI
- 10.1023/A:1025671410623 · DOI · Paper page
- Lau T., 2004, Workshop on SCLAS, AAAI
- Lau T. A., 2000, ICML
- 10.1145/945645.945654 · DOI
- Miller R. C., 2001, USENIX Annual Technical Conference
- T. M. Mitchell. Generalization as search. Artif. Intell. 18 (2) 1982. T. M. Mitchell. Generalization as search. Artif. Intell. 18 (2) 1982. · DOI · Paper page
- 10.1145/4472.4476 · DOI
- S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach (2nd Edition). Prentice Hall 2 edition December 2002. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach (2nd Edition). Prentice Hall 2 edition December 2002.
- 10.1145/1706299.1706337 · DOI · Paper page
- 10.5555/645516.658243 · doi:10.5555/645516.658243
- Walkenbach J., 2010, John Wiley and Sons
- Witten I. H., 1993, Watch what I do: programming by demonstration, 293
- 10.1145/1806596.1806622 · DOI
Cited by
Grounded Copilot: How Programmers Interact with Code-Generating Models
Barke, S., James, M. B., & Polikarpova, N. (2023) · Proceedings of the ACM on Programming Languages · doi:10.1145/3586030 · Cited by 436
Program Synthesis with Large Language Models
Austin, J., Odena, A., Nye, M., Bosma, M., Michalewski, H., Dohan, D., Jiang, E., Cai, C., Terry, M., Le, Q., et al. (2021) · arXiv · doi:10.48550/arxiv.2108.07732 · Cited by 388
“, 2020], but these techniques have largely been applied to restricted domain-specific languages (DSLs) [Gulwani, 2011] or to languages that are more fully featured but that nevertheless are designed specifically with synthesis in mind [Odena and Sutton, 2020].”
MethodStudying the effect of AI Code Generators on Supporting Novice Learners in Introductory Programming
Kazemitabaar, M., Chow, J., Ma, C. K. T., Ericson, B. J., Weintrop, D., & Grossman, T. (2023) · Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems · doi:10.1145/3544548.3580919 · Cited by 366
“Various methods have been employed, such as using semantic parsers [4, 9, 11, 18, 33, 34, 47, 50, 51, 56, 68, 80] and machine learning [5, 54, 71–73, 93, 95].”
Is the cure worse than the disease? overfitting in automated program repair
Smith, E. K., Barr, E. T., Le Goues, C., & Brun, Y. (2015) · Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering · doi:10.1145/2786805.2786825 · Cited by 323
InCoder: A Generative Model for Code Infilling and Synthesis
Fried, D., Aghajanyan, A., Lin, J., Wang, S., Wallace, E., Shi, F., Zhong, R., Yih, W.-T., Zettlemoyer, L., & Lewis, M. (2022) · arXiv · doi:10.48550/arxiv.2204.05999 · Cited by 187
“, input-output examples [12, 28, 19, 13], partial implementations [58], or natural language descriptions [74, 73, 72, 42, 18] of the desired program as input.”
Background
Metadata
- Authors
- Gulwani, S.
- Venue
- Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
- Publisher
- ACM
- Published
- 2011-01-26
- Pages
- 317-330
- OpenAlex
- W4237412827
- Cited by
- 446
- References
- 0
- FWCI
- 15.10
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Automating string processing in spreadsheets using input-output examples. https://app.cochat.ai/papers/10.1145/1926385.1926423
- The paper
- Gulwani, S. (2011). Automating string processing in spreadsheets using input-output examples. Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. https://doi.org/10.1145/1926385.1926423
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.