Programming-by-Example with Nested Examples

被引:0
|
作者
Katz, Tomer [1 ]
Peleg, Hila [1 ]
机构
[1] Technion, Haifa, Israel
关键词
D O I
10.1109/VL-HCC57772.2023.00053
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
As program synthesizers become integrated into IDEs, programmers combine synthesized code and manuallywritten code within the same project. When documenting the provenance of synthesized code, this can result in a larger segment of example-specified code encompassing a smaller one. In this state, the programmer can decide to re-run the synthesizer, either to refactor the code or to automatically correct manuallywritten code. State of the art Programming by Example synthesizers cannot handle this nested specification: synthesis will only consider the outer-most block, discarding any code or additional specification inside. Moreover, the outer-most scope contains less specifications, but describes more functionality, which can easily result in the synthesizer either timing out or overfitting. To address this information loss we propose a technique that can be used to re-synthesize code from previously documented nested specifications, preserving the information that the internal specifications contain. We then evaluated our implementation on 12 benchmarks based on SyGus competition benchmarks, and show that the technique allows the user to re-synthesize larger code segments while adding fewer examples compared to just using the specification from the outer-most block.
引用
收藏
页码:280 / 282
页数:3
相关论文
共 50 条
  • [21] PROGRAMMING ROBOTS BY EXAMPLE
    HEISE, R
    INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 1993, 8 (06) : 685 - 709
  • [22] nlp: A compiler for nested logic programming
    Sarsakov, V
    Schaub, T
    Tompits, H
    Woltran, S
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, PROCEEDINGS, 2004, 2923 : 361 - 364
  • [23] FUZZY GOAL PROGRAMMING WITH NESTED PRIORITIES
    RUBIN, PA
    NARASIMHAN, R
    FUZZY SETS AND SYSTEMS, 1984, 14 (02) : 115 - 129
  • [24] Nested Preferences in Answer Set Programming
    Confalonieri, Roberto
    Carlos Nieves, Juan
    FUNDAMENTA INFORMATICAE, 2011, 113 (01) : 19 - 39
  • [25] Programming by Examples applied to Data Manipulation
    Gulwani, Sumit
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2016, (202): : 2 - 2
  • [26] A Review of Worked Examples in Programming Activities
    Muldner, Kasia
    Jennings, Jay
    Chiarelli, Veronica
    ACM TRANSACTIONS ON COMPUTING EDUCATION, 2023, 23 (01)
  • [27] Programming by Examples: PL Meets ML
    Gulwani, Sumit
    Jain, Prateek
    PROGRAMMING LANGUAGES AND SYSTEMS (APLAS 2017), 2017, 10695 : 3 - 20
  • [28] A Study ofWorked Examples for SQL Programming
    Akhuseyinoglu, Kamil
    Hardt, Ryan
    Barria-Pineda, Jordan
    Brusilovsky, Peter
    Pollari-Malmi, Kerttu
    Sirkia, Teemu
    Malmi, Lauri
    PROCEEDINGS OF THE 27TH ACM CONFERENCE ON INNOVATION AND TECHNOLOGY IN COMPUTER SCIENCE EDUCATION, ITICSE 2022, VOL 1, 2022, : 82 - 88
  • [29] Programming Examples Needing Polymorphic Recursion
    Hallett, J. J.
    Kfoury, A. J.
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 136 : 57 - 102
  • [30] Executable Examples for Programming Problem Comprehension
    Wrenn, John
    Krishnamurthi, Shriram
    ICER '19 - PROCEEDINGS OF THE 2019 ACM CONFERENCE ON INTERNATIONAL COMPUTING EDUCATION RESEARCH, 2019, : 131 - 139