Guarantees in Program Synthesis Qin inhepin ing Hu , Jason Breck , - PowerPoint PPT Presentation

Guarantees in Program Synthesis Qin inhepin ing Hu , Jason Breck , John Cyphert , Loris D'Antoni , Thomas Reps 1

(What you want your program to do) Program 𝑄 Specification Synthesizer ( 𝑄 satisfies the specification Search space 𝑄 is in the search space) (candidate solutions) Not always enough!

Specification : ∀0 ≤ 𝑦 < 100. 𝑄 𝑦 = 𝑦 + 1 Solution 1: Solution 2: return x+1; if (x=0) return 1; if (x=1) return 2; if (x=2) return 3; … if (x=99) return 100; return − 1; 3

[PLDI17] Automatic Program Inversion 4

Gu Guarantees ntees in Program Synthesis Program 𝑄 Specification Synthesizer Search space Quantitative objective Unrealizable (no solution) (ability to prefer better solutions)

[CAV18] Syntax-Guided Synthesis + Quantitative objective Program 𝑄 Specification Synthesizer Search space Quantitative objective (user assign costs to rules) Grammar: Logic formula: Start := Start+Start 𝜚 𝑄 : ∀𝑦, 𝑧. 𝑄 ≥ 𝑦 ∧ 𝑄 ≥ 𝑧 0 | ITE(BExpr,Start,Start) 1 ∧ (𝑄 = 𝑦 ∨ 𝑄 = 𝑧) 0 | 𝑦 | 𝑧 | 0 | 1 BExpr := NOT(BExpr) 0 | Start > Start Quantitative objective: 0 | Start AND Start Minimize the number of ITE 0

SyGuS QSyGuS Solution’s weight 𝟑 Weighted Grammar 𝐻 CFG 𝐻 <2 grammar 𝑋 Grammar 𝐻 <2 : Start := Start0 | Start1 BExpr0 := NOT(BExpr0) Start1 := Start1+Start0 | Start0 > Start0 | ITE(BExpr0,Start0,Start0) | Start0 AND Start0 | 𝑦 | 𝑧 | 0 | 1 Start0 := Start1+Start0 | 𝑦 | 𝑧 | 0 | 1 11

SyGuS QSyGuS Solution’s Solution’s weight 𝟑 weight 𝟐 Weighted Grammar 𝐻 CFG 𝐻 <2 grammar 𝑋 Grammar 𝐻 <2 : Start := Start0 | Start1 BExpr0 := NOT(BExpr0) Start1 := Start1+Start0 | Start0 > Start0 | ITE(BExpr0,Start0,Start0) | Start0 AND Start0 | 𝑦 | 𝑧 | 0 | 1 Solution in 𝐻 <2 : Start0 := Start1+Start0 ITE 𝑦 > 𝑧, 𝑦, 𝑧 | 𝑦 | 𝑧 | 0 | 1 12

SyGuS QSyGuS Solution’s Solution’s weight 𝟑 weight 𝟐 Weighted Grammar 𝐻 CFG 𝐻 <2 CFG 𝐻 <1 ? grammar 𝑋 Grammar 𝐻 <1 : Start := Start+Start | 𝑦 | 𝑧 | 0 | 1 Solution 𝐽𝑈𝐹 𝑦 > 𝑧, 𝑦, 𝑧 is minimized There is no o so solution in 𝐻 <1 13

Program 𝑄 Specification Synthesizer Search space Unrealizable Quantitative objective (no solution) Search-based synthesizer + infinite search space = Timeout! 14

[CAV19] Proving a SyGuS problem is unrealizable Grammar G <1 : Specification: 𝑄 0,0 = 0 ∧ 𝑄 0,1 = 1 Start := Start+Start ∧ 𝑄 1,0 = 1 ∧ 𝑄 2,0 = 2 | 𝑦 | 𝑧 | 0 | 1 int[4] Start(x_0,y_0,x_1,y_1,x_2,y_2,x_3,y_3){ if(??){return (0,0,0,0);} // Start -> 0 if(??){return (1,1,1,1);} // Start -> 1 if(??){return (x_0,x_1,x_2,x_3);} // Start -> x if(??){return (y_0,y_1,y_2,y_3);} // Start -> y else{ // Start -> Start+Start int[4] L = Start(x_0,y_0,x_1,y_1); int[4] R = Start(x_0,y_0,x_1,y_1); return (L[0]+R[0],L[1]+R[1],L[2]+R[2],L[3]+R[3]);} } int[4] P = Start(0,0,0,1,1,0,2,0); assert (P[0]!=0 || P[1]!=1 || P[2]!=1 || P[3]!=2);

The assertion always holds The SyGuS problem is unrealizable int[4] Start(x_0,y_0,x_1,y_1,x_2,y_2,x_3,y_3){ if(??){return (0,0,0,0);} // Start -> 0 if(??){return (1,1,1,1);} // Start -> 1 if(??){return (x_0,x_1,x_2,x_3);} // Start -> x if(??){return (y_0,y_1,y_2,y_3);} // Start -> y else{ // Start -> Start+Start int[4] L = Start(x_0,y_0,x_1,y_1); int[4] R = Start(x_0,y_0,x_1,y_1); return (L[0]+R[0],L[1]+R[1],L[2]+R[2],L[3]+R[3]);} } int[4] P = Start(0,0,0,1,1,0,2,0); assert (P[0]!=0 || P[1]!=1 || P[2]!=1 || P[3]!=2);

Gu Guarantees ntees in Program Synthesis Program 𝑄 Specification Synthesizer Search space Unrealizable Quantitative objective Proving unrealizability beyond SyGuS More quantitative objectives • Semantic quantitative objectives • Resource bounded synthesis

Guarantees in Program Synthesis Qin inhepin ing Hu , Jason Breck , - PowerPoint PPT Presentation

Guarantees in Program Synthesis Qin inhepin ing Hu , Jason Breck , John Cyphert , Loris D'Antoni , Thomas Reps 1 (What you want your program to do) Program Specification Synthesizer ( satisfies the specification Search space

Guarantees in in Program Synthesis Qinheping Hu , Jason Breck , John Cyphert , Loris D'Antoni ,

From Program Synthesis to Optimal Program . . . Optimal Program Synthesis Logical Interpretation

Synthesis of Ranking Functions and Synthesis of Inductive Invariants and Synthesis of

Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games V.

From Program Verification to Program Synthesis Overview Jaak Ristioja March 30, 2010 1 / 91

Conditional Program Generation for Bimodal Program Synthesis Swarat Chaudhuri Rice University

Recursive Program Synthesis Aws Albarghouthi (UToronto), Sumit Gulwani (MSR), and Zachary

Syntax-Guided Synthesis Rajeev Alur University of Pennsylvania 1 Program Verification Program

Deep Learning over Big Code for Program Analysis and Synthesis Swarat Chaudhuri, Vijay

The minimal restriction that guarantees that the unpredictability of ordering will not affect

Neural Program Synthesis with Priority Queue Training Daniel A. Abolafia, Mohammad Norouzi,

Adaptive)Concretization)for) Parallel)Program)Synthesis) Jinseong(Jeon 1 ,)Xiaokang)Qiu 2 ,)

Adaptive)Concretization)for) Parallel)Program)Synthesis) Jinseong(Jeon 1 ,)Xiaokang)Qiu 2 ,)

Program Synthesis Tikhon Jelvis (tikhon@jelv.is) February 24, 2014 Synthesis Find a program

Improving Neural Program Synthesis with Inferred Execution Traces Richard Shin 1 Illia Polosukhin

M emory A ugmented P olicy O ptimization ( MAPO ) for Program Synthesis and Semantic Parsing Chen

T HE R OLE OF BEKP S TRENGTH ON ITS M ARKET S HARE Paulo Csar Pavan 1 CONCLUDING REMARKS

Exact Result for boundaries (and domain walls) in 2d supersymmetric theory Daigo Honda

Noether theorems in a general setting. Reducible graded Lagrangians Basic reference:

Operating System Concepts Mehdi Kargahi ECE Department University of Tehran Spring 2008 1

Grammar 1: Nouns and Verbs Nouns: people, places, things, ideas Verbs: action words

Overview Two-Part MDL Two-Part MDL Two-Part MDL for Two-Part MDL for Grammar Learning

Implementing finite state machines The PROLOG programming language (1) PROgrammation LOGique

Computational Logic Pure (Declarative) Logic Programs 1 Pure Logic Programs (Overview)