BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Synthesis United: Boolean Functional Synthesis: Some Recent Advanc
 es - Supratik Chakraborty (Indian Institute of Technology)
DTSTART:20220718T120000Z
DTEND:20220718T124500Z
UID:TALK176759@talks.cam.ac.uk
DESCRIPTION:Suppose we want to design a system with inputs X and outputs Y
 \, such that the relation between X and Y is specified as a Boolean formul
 a \\varphi(X\, Y). &nbsp\;The problem of synthesizing Y as a function of X
 \, say F(X)\, &nbsp\;s.t. that \\varphi(X\, F(X)) holds for all X is the c
 lassical synthesis problem. &nbsp\;We augment this problem definition to i
 nclude cases where the specification is &nbsp\;"unrealizable" in the class
 ical sense\, i.e. there exist some values of X for which no value of Y sat
 isfies the spec. &nbsp\;Specificially\, we ask if we can synthesize Y as a
  function F(X) such that \\varphi(X\, F(X)) holds for all values of X for 
 which \\exists Y \\varphi(X\, Y) holds. &nbsp\;It turns out thatthere are 
 many interesting applications where this notion of synthesis is useful. &n
 bsp\;We present an overview of two different approaches that have been rec
 ently proposed to solve the above problem -- one based on an iterative rep
 air algorithm\, and the other based on knowlege compilation. We present re
 sults obtained from each of these approaches and outline some future direc
 tions of research.&nbsp\;
LOCATION:Seminar Room 2\, Newton Institute
END:VEVENT
END:VCALENDAR