1 / 8

Templates of slides for P3

Templates of slides for P3. A brief update on your problem (important). Describe in English what artifacts (programs, etc) will you synthesize , what is your behavioral spec ? (i/o examples? a ref impl ?) list the benchmarks/tests you created to drive your design [30 seconds].

rosalyn-lynch
Download Presentation

Templates of slides for P3

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Templates of slides for P3

  2. A brief update on your problem (important) Describe in English • what artifacts (programs, etc) will you synthesize, • what is your behavioral spec? (i/o examples? a ref impl?) • list the benchmarks/tests you created to drive your design [30 seconds]

  3. Demo of a program in your language (YL) Show us an example of a typical program in YL Walk us through the code Include a screenshot of running example

  4. Revisions to YL (brief slide) Describe how you simplified YL • what observations allowed you to drop a construct • or reduce it to a smaller language core? Did you have to add a construct? • what use case necessitated that? Argue YL is the smallest language for your task

  5. Holes in YL (the key slide) Describe your candidate space (CS) what set of programs will your synthesizer search CS can be described by defining a “hole” construct holes are what your synthesizer will complete A definition of “hole” has two parts: • where can holes appear in YL programs eg: loop bounds; lock placement; Xpath expressions • with what expressions are holes completed? eg: linear over induction vars; lock placement freedom; equality between node ids and string literals You should try to explain these points entirely on the example from the next slide.

  6. Example and size of Candidate Space Show example of a sketch • reuse example from slide 3; add holes to it Size of the candidate space you need to search • may be larger than you expect (unless you found tiny YL) • determines what algorithm you need to use • likely will show you can’t just gen-and-test candidates Back-of-the-envelope space estimates • think of holes as grammars (add holes to YL grammar, GH) • what is the size of largest program you need to find, s • how many candidate programs of up to size s are in L(GH)?

  7. Checklist • demo of screenshot • revisions to your language • sketches: what are YL holes and where can they go? • size of candidate space that needs to be searched

  8. Next project presentation In P4, you will have a compiler from YL to formulas Or to some other scalable synthesis algorithm

More Related