BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:bc32a177-1580-48d9-9707-2750b9c163a0
X-WR-CALNAME:[MTV] - Théo Matricon (LaBRI) - Language Sharpening for Progra
 m Synthesis
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20241027T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20221030T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20231029T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20230326T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20240331T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:bc32a177-1580-48d9-9707-2750b9c163a0
DTSTAMP:20260413T163021Z
CLASS:PUBLIC
DESCRIPTION:The first question when deploying a program synthesis approach 
 is the design of the target programming language\, called domain-specific 
 language (DSL). This raises a number of challenges: the language must be r
 ich and expressive\, while using a simple and minimal syntax. We study lan
 guage sharpening\, which is the task of improving a DSL by removing redund
 ant and useless programs. We propose a rule-based approach for language sh
 arpening\, and present two technical contributions. The first is an algori
 thm for automatically generating equations satisfied by all programs\, whi
 ch we use to significantly reduce the space of all programs. The second is
  a new compilation algorithm for our rules-based approach\, based on tree 
 automata models. We integrate both algorithms in a program synthesis pipel
 ine to evaluate the benefits of language sharpening in two application dom
 ains.
DTSTART;TZID=Europe/Paris:20230413T130000
DTEND;TZID=Europe/Paris:20230413T140000
LOCATION:salle 178\, zoom: https://bordeaux-inp-fr.zoom.us/j/89508306159
SEQUENCE:0
SUMMARY:[MTV] - Théo Matricon (LaBRI) - Language Sharpening for Program Syn
 thesis
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
