inductive program synthesis for bidirectional
play

Inductive Program Synthesis for Bidirectional Transformations - PowerPoint PPT Presentation

Nov 14, 2023 •561 likes •1.17k views

Inductive Program Synthesis for Bidirectional Transformations Tobias G odderz, Helmut Grohne, Janis Voigtl ander University of Bonn Dagstuhl Seminar 15442 Bidirectional Transformation source view get s v v s 1 1/4

  1. Inductive Program Synthesis for Bidirectional Transformations Tobias G¨ odderz, Helmut Grohne, Janis Voigtl¨ ander University of Bonn Dagstuhl Seminar 15442

  2. Bidirectional Transformation source view get s v v ′ s ′ 1 – 1/4

  3. Bidirectional Transformation source view get s v update v ′ s ′ 1 – 2/4

  4. Bidirectional Transformation source view get s v update v ′ s ′ put 1 – 3/4

  5. Bidirectional Transformation source view get s v update v ′ s ′ put 1 – 4/4

  6. Bidirectional Transformation Examples: tail “abc” “bc” “ade” “de” 2 – 5/13

  7. Bidirectional Transformation Examples: tail “abc” “bc” update “ade” “de” 2 – 6/13

  8. Bidirectional Transformation Examples: tail “abc” “bc” update “ade” “de” put 2 – 7/13

  9. Bidirectional Transformation Examples: flatten “abac” ‘a’ ‘b’ ‘a’ ‘c’ “abxc” ‘a’ ‘b’ ‘x’ ‘c’ 2 – 8/13

  10. Bidirectional Transformation Examples: flatten “abac” ‘a’ ‘b’ ‘a’ ‘c’ update “abxc” ‘a’ ‘b’ ‘x’ ‘c’ 2 – 9/13

  11. Bidirectional Transformation Examples: flatten “abac” ‘a’ ‘b’ ‘a’ ‘c’ update “abxc” put ‘a’ ‘b’ ‘x’ ‘c’ 2 – 10/13

  12. Bidirectional Transformation Examples: nub ◦ flatten “abc” ‘a’ ‘b’ ‘a’ ‘c’ “xbc” ‘x’ ‘b’ ‘x’ ‘c’ 2 – 11/13

  13. Bidirectional Transformation Examples: nub ◦ flatten “abc” ‘a’ ‘b’ ‘a’ ‘c’ update “xbc” ‘x’ ‘b’ ‘x’ ‘c’ 2 – 12/13

  14. Bidirectional Transformation Examples: nub ◦ flatten “abc” ‘a’ ‘b’ ‘a’ ‘c’ update “xbc” put ‘x’ ‘b’ ‘x’ ‘c’ 2 – 13/13

  15. Bidirectional Transformation source view get s v update v ′ s ′ put 3 – 14/15

  16. Bidirectional Transformation – Laws source view get s v update v ′ s ′ put 3 – 15/15

  17. Bidirectional Transformation – Laws source view get s v = s v Acceptability / GetPut 4 – 16/19

  18. Bidirectional Transformation – Laws source view get s v = = s v put Acceptability / GetPut 4 – 17/19

  19. Bidirectional Transformation – Laws source view get s v update v ′ s ′ put Consistency / PutGet 4 – 18/19

  20. Bidirectional Transformation – Laws source view get s v update s ′ v ′ put get Consistency / PutGet 4 – 19/19

  21. Bidirectional Transformation source view get s v update v ′ s ′ put 5 – 20/22

  22. Bidirectional Transformation – PL Approaches source view get s v update s ′ v ′ put Lenses, DSLs [Foster et al., ACM TOPLAS’07, . . . ] 5 – 21/22

  23. Bidirectional Transformation – PL Approaches source view get s v update v ′ s ′ put Bidirectionalization [Matsuda et al., ICFP’07], [V., POPL’09], . . . 5 – 22/22

  24. Nondeterminism / Choices to make Let get = sieve with: s "" "a" "ab" "abc" "abcd" "abcde" sieve s "" "" "b" "b" "bd" "bd" 6 – 23/33

  25. Nondeterminism / Choices to make Let get = sieve with: s "" "a" "ab" "abc" "abcd" "abcde" sieve s "" "" "b" "b" "bd" "bd" Then, for example: "xy" = "axcy" put "abcd" 6 – 24/33

  26. Nondeterminism / Choices to make Let get = sieve with: s "" "a" "ab" "abc" "abcd" "abcde" sieve s "" "" "b" "b" "bd" "bd" Then, for example: "xy" = "axcy" put "abcd" put "abcde" "xy" = "axcye" 6 – 25/33

  27. Nondeterminism / Choices to make Let get = sieve with: s "" "a" "ab" "abc" "abcd" "abcde" sieve s "" "" "b" "b" "bd" "bd" Then, for example: "xy" = "axcy" put "abcd" put "abcde" "xy" = "axcye" put "abcde" "xyz" = 6 – 26/33

  28. Nondeterminism / Choices to make Let get = sieve with: s "" "a" "ab" "abc" "abcd" "abcde" sieve s "" "" "b" "b" "bd" "bd" Then, for example: "xy" = "axcy" put "abcd" put "abcde" "xy" = "axcye" put "abcde" "xyz" = "axcyez" 6 – 27/33

  29. Nondeterminism / Choices to make Let get = sieve with: s "" "a" "ab" "abc" "abcd" "abcde" sieve s "" "" "b" "b" "bd" "bd" Then, for example: "xy" = "axcy" put "abcd" put "abcde" "xy" = "axcye" put "abcde" "xyz" = "axcyez" or "axcyez " ? 6 – 28/33

  30. Nondeterminism / Choices to make Let get = sieve with: s "" "a" "ab" "abc" "abcd" "abcde" sieve s "" "" "b" "b" "bd" "bd" Then, for example: "xy" = "axcy" put "abcd" put "abcde" "xy" = "axcye" put "abcde" "xyz" = "axcyez" or "axcyez " ? "xyz" = "axcy z" put "abcd" 6 – 29/33

  31. Nondeterminism / Choices to make Let get = sieve with: s "" "a" "ab" "abc" "abcd" "abcde" sieve s "" "" "b" "b" "bd" "bd" Then, for example: "xy" = "axcy" put "abcd" put "abcde" "xy" = "axcye" put "abcde" "xyz" = "axcyez" or "axcyez " ? "xyz" = "axcy z" put "abcd" = put "abcd" "x" 6 – 30/33

  32. Nondeterminism / Choices to make Let get = sieve with: s "" "a" "ab" "abc" "abcd" "abcde" sieve s "" "" "b" "b" "bd" "bd" Then, for example: "xy" = "axcy" put "abcd" put "abcde" "xy" = "axcye" put "abcde" "xyz" = "axcyez" or "axcyez " ? "xyz" = "axcy z" put "abcd" = "axc" put "abcd" "x" 6 – 31/33

  33. Nondeterminism / Choices to make Let get = sieve with: s "" "a" "ab" "abc" "abcd" "abcde" sieve s "" "" "b" "b" "bd" "bd" Then, for example: "xy" = "axcy" put "abcd" put "abcde" "xy" = "axcye" put "abcde" "xyz" = "axcyez" or "axcyez " ? "xyz" = "axcy z" put "abcd" = "axc" or "ax" ? put "abcd" "x" 6 – 32/33

  34. Nondeterminism / Choices to make Let get = sieve with: s "" "a" "ab" "abc" "abcd" "abcde" sieve s "" "" "b" "b" "bd" "bd" Then, for example: "xy" = "axcy" put "abcd" put "abcde" "xy" = "axcye" put "abcde" "xyz" = "axcyez" or "axcyez " ? "xyz" = "axcy z" put "abcd" = "axc" or "ax" ? , or "cx" ? put "abcd" "x" 6 – 33/33

  35. Nondeterminism / Choices to make Let get = head with: head ( x : xs ) = x 7 – 34/38

  36. Nondeterminism / Choices to make Let get = head with: head ( x : xs ) = x Maybe: put ( x : xs ) y = [ y ] 7 – 35/38

  37. Nondeterminism / Choices to make Let get = head with: head ( x : xs ) = x Maybe: put ( x : xs ) y = [ y ] But that violates put s ( get s ) = s ! 7 – 36/38

  38. Nondeterminism / Choices to make Let get = head with: head ( x : xs ) = x Maybe: put ( x : xs ) y = [ y ] But that violates put s ( get s ) = s ! Better: put ( x : xs ) y | y == x = ( x : xs ) | otherwise = [ y ] 7 – 37/38

  39. Nondeterminism / Choices to make Let get = head with: head ( x : xs ) = x Maybe: put ( x : xs ) y = [ y ] But that violates put s ( get s ) = s ! Better: put ( x : xs ) y | y == x = ( x : xs ) | otherwise = [ y ] But “really intended”: put ( x : xs ) y = ( y : xs ) 7 – 38/38

  40. A slightly more complex case, with recursion Let get = init with: init [ x ] = [ ] init ( x : xs ) = ( x : ( init xs )) 8 – 39/42

Recommend

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

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

Synthesis of Ranking Functions and Synthesis of Inductive Invariants and Synthesis of Recurrence Sets via Constraint Solving Andreas Podelski January 17, 2012 1 Program Verification and Constraints Reasoning about program

422 views • 28 slides
Synthesis, Verification, and Synthesis, Verification, and Inductive Learning Inductive Learning

Synthesis, Verification, and Synthesis, Verification, and Inductive Learning Inductive Learning

Synthesis, Verification, and Synthesis, Verification, and Inductive Learning Inductive Learning Sanjit A. Seshia EECS Department UC Berkeley Joint work with Susmit Jha (UTC) Dagstuhl Seminar Verified SW Working Group August 2014 July

661 views • 28 slides
FlashMeta Microsoft PROSE SDK: A Framework for Inductive Program Synthesis Oleksandr Polozov

FlashMeta Microsoft PROSE SDK: A Framework for Inductive Program Synthesis Oleksandr Polozov

FlashMeta Microsoft PROSE SDK: A Framework for Inductive Program Synthesis Oleksandr Polozov Sumit Gulwani University of Washington Microsoft Research Why do people create frameworks? Industrialization (a.k.a. Tech Transfer) 2 3

574 views • 39 slides
Ideas for Connecting Inductive Program Synthesis and Bidirectionalization Janis Voigtl ander

Ideas for Connecting Inductive Program Synthesis and Bidirectionalization Janis Voigtl ander

Ideas for Connecting Inductive Program Synthesis and Bidirectionalization Janis Voigtl ander University of Bonn PEPM12 A small test Which function is this? f 1 [ a ] = a f 1 [ a , b ] = b f 1 [ a , b , c ] = c f 1 [ a , b , c , d

975 views • 70 slides
Program Synthesis in the Industrial World: Inductive, Incremental, Interactive Alex Polozov

Program Synthesis in the Industrial World: Inductive, Incremental, Interactive Alex Polozov

Program Synthesis in the Industrial World: Inductive, Incremental, Interactive Alex Polozov Sumit Gulwani polozov@cs.washington.edu sumitg@microsoft.com And the rest of the PROSE team! prose-contact@microsoft.com July 18, 2016 SYNT-16,

603 views • 44 slides
Path-based Inductive Synthesis for Program Inversion Saurabh Srivastava (a) Sumit Gulwani (b)

Path-based Inductive Synthesis for Program Inversion Saurabh Srivastava (a) Sumit Gulwani (b)

Path-based Inductive Synthesis for Program Inversion Saurabh Srivastava (a) Sumit Gulwani (b) Swarat Chaudhuri (c) Jeffrey S. Foster (d) (a) University of California, Berkeley (b) Microsoft Research, Redmond (c) Rice University (d) University of

1.24k views • 58 slides
Adapted Deep Embeddings: A Synthesis of Methods for ! -Shot Inductive Transfer Learning Tyler R.

Adapted Deep Embeddings: A Synthesis of Methods for ! -Shot Inductive Transfer Learning Tyler R.

Adapted Deep Embeddings: A Synthesis of Methods for ! -Shot Inductive Transfer Learning Tyler R. Scott 1,2 , Karl Ridgeway 1,2 , Michael C. Mozer 1,3 1 University of Colorado, Boulder 2 Sensory Inc. 3 Presently at Google Brain Inductive Transfer

196 views • 16 slides
Realistic Image Synthesis Bidirectional Path Tracing & Reciprocity Philipp Slusallek Karol

Realistic Image Synthesis Bidirectional Path Tracing & Reciprocity Philipp Slusallek Karol

Realistic Image Synthesis Bidirectional Path Tracing & Reciprocity Philipp Slusallek Karol Myszkowski Gurprit Singh Realistic Image Synthesis SS2020 Bidirectional Path Tracing Philipp Slusallek Path Sampling Techniques Different

577 views • 31 slides
From Program Synthesis to Optimal Program . . . Optimal Program Synthesis Logical Interpretation

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

Need for Data . . . Program Synthesis Wave Algorithm for . . . Boolean Logic . . . From Program Synthesis to Optimal Program . . . Optimal Program Synthesis Logical Interpretation . . . A Seemingly Natural . . . Counter-Example to . . .

725 views • 24 slides
Logic-based inductive synthesis of efficient programs Andrew Cropper Imperial College London

Logic-based inductive synthesis of efficient programs Andrew Cropper Imperial College London

Logic-based inductive synthesis of efficient programs Andrew Cropper Imperial College London String transformations Outpu Input t Computer Aided Verification CAV Principles Of Programming Languages POPL International Conference on

334 views • 12 slides
National Diabetes Prevention Program (National DPP) and Utah Tobacco Quitline Bidirectional

National Diabetes Prevention Program (National DPP) and Utah Tobacco Quitline Bidirectional

National Diabetes Prevention Program (National DPP) and Utah Tobacco Quitline Bidirectional Referral Training Why establish a bidirectional referral system? An opportunity exists to connect tobacco users enrolled in DPP programs with

288 views • 12 slides
Guarantees in in Program Synthesis Qinheping Hu , Jason Breck , John Cyphert , Loris D'Antoni ,

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

Guarantees in in Program Synthesis Qinheping Hu , Jason Breck , John Cyphert , Loris D'Antoni , Thomas Reps Program Synthesis Specification Solution Program Synthesizer Search space Program Synthesis is Un Unpredicta edictable ble

1.05k views • 41 slides
Bidirectional Transformations a PL perspective BIRS meeting on BX, 2013 Bidirectional

Bidirectional Transformations a PL perspective BIRS meeting on BX, 2013 Bidirectional

Bidirectional Transformations a PL perspective BIRS meeting on BX, 2013 Bidirectional Transformations (BX) to A B from database source materialized view software model code document representation screen visualization

1.27k views • 82 slides
From Program Verification to Program Synthesis Overview Jaak Ristioja March 30, 2010 1 / 91

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

From Program Verification to Program Synthesis Overview Jaak Ristioja March 30, 2010 1 / 91 Reference From Program Verification to Program Synthesis. @ POPL10; January 17-23, 2010 Saurabh Srivastava , University of Maryland, College Park

1.21k views • 91 slides
Conditional Program Generation for Bimodal Program Synthesis Swarat Chaudhuri Rice University

Conditional Program Generation for Bimodal Program Synthesis Swarat Chaudhuri Rice University

Conditional Program Generation for Bimodal Program Synthesis Swarat Chaudhuri Rice University www.cs.rice.edu/~swarat (Joint work with Chris Jermaine, Vijay Murali, and Letao Qi) Program synthesis [Simon 1963, Summers 1977, Manna-Waldinger

411 views • 22 slides
Recursive Program Synthesis Aws Albarghouthi (UToronto), Sumit Gulwani (MSR), and Zachary

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

Recursive Program Synthesis Aws Albarghouthi (UToronto), Sumit Gulwani (MSR), and Zachary Kincaid (UToronto) CAV 2013 Saint Petersburg, Russia Program Synthesis Magic Specification Program 2 Program Synthesis Magic Specification

753 views • 74 slides
Syntax-Guided Synthesis Rajeev Alur University of Pennsylvania 1 Program Verification Program

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

Syntax-Guided Synthesis Rajeev Alur University of Pennsylvania 1 Program Verification Program P Specification S Verifier Proof of correctness or Witness of a bug 2 Classical Program Synthesis Specification S High Level WHAT

1.28k views • 59 slides
Deep Learning over Big Code for Program Analysis and Synthesis Swarat Chaudhuri, Vijay

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

Deep Learning over Big Code for Program Analysis and Synthesis Swarat Chaudhuri, Vijay Murali, Chris Jermaine Programming is hard Program synthesis, debugging, verification, repair Can we automate these processes? Decades of prior

1.59k views • 143 slides
Inductive Definitions with Inference Rules 1 / 25 Outline Introduction Specifying inductive

Inductive Definitions with Inference Rules 1 / 25 Outline Introduction Specifying inductive

Inductive Definitions with Inference Rules 1 / 25 Outline Introduction Specifying inductive definitions Inference rules in action Judgments, axioms, and rules Reasoning about inductive definitions Direct proofs Admissibility Rule induction

498 views • 25 slides
Effects of Approximate Filtering on the Appearance of Bidirectional Texture Functions Adrian

Effects of Approximate Filtering on the Appearance of Bidirectional Texture Functions Adrian

Effects of Approximate Filtering on the Appearance of Bidirectional Texture Functions Adrian Jarabo, Hongzhi Wu, Julie Dorsey, Holly Rushmeier, Diego Gutierrez Bidirectional Texture Function [Filip et al.11] Bidirectional Texture Function

483 views • 34 slides
Inductive types in Coq Wessel van Staal November 23, 2012 Inductive types Inductive nattree :

Inductive types in Coq Wessel van Staal November 23, 2012 Inductive types Inductive nattree :

Inductive types in Coq Wessel van Staal November 23, 2012 Inductive types Inductive nattree : Set := leaf : nat -> nattree | node : nattree -> nattree -> nattree. Adds constant or function with final type Prop , Set or Type to

325 views • 14 slides
Neural Program Synthesis with Priority Queue Training Daniel A. Abolafia, Mohammad Norouzi,

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

Neural Program Synthesis with Priority Queue Training Daniel A. Abolafia, Mohammad Norouzi, Jonathan Shen, Rui Zhao, Quoc V. Le https://arxiv.org/abs/1801.03526 Why Program Synthesis? One of the hard AI reasoning domains A tool for

819 views • 27 slides
Adaptive)Concretization)for) Parallel)Program)Synthesis) Jinseong(Jeon 1 ,)Xiaokang)Qiu 2 ,)

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

Adaptive)Concretization)for) Parallel)Program)Synthesis) Jinseong(Jeon 1 ,)Xiaokang)Qiu 2 ,) Armando)Solar@Lezama 2 ,)and)Jeffrey)S.)Foster 1) ) 1.)University)of)Maryland,)College)Park) 2.)MIT)CSAIL ) Syntax@guided)Synthesis) bit[32]

310 views • 27 slides
Adaptive)Concretization)for) Parallel)Program)Synthesis) Jinseong(Jeon 1 ,)Xiaokang)Qiu 2 ,)

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

Adaptive)Concretization)for) Parallel)Program)Synthesis) Jinseong(Jeon 1 ,)Xiaokang)Qiu 2 ,) Armando)Solar@Lezama 2 ,)and)Jeffrey)S.)Foster 1) ) 1.)University)of)Maryland,)College)Park) 2.)MIT)CSAIL ) Syntax@guided)Synthesis) bit[32]

579 views • 57 slides

More recommend