| |
 Tractable Representations for Automated Functional Synthesis Speaker (s):
S. Akshay
Professor
Department of Computer Science
and Engineering
Indian Institute of Technology Bombay
| Date: Time: Venue: | | 24 April 2025, Thursday 10:30am – 11:30am School of Computing &
Information Systems 2
(SCIS 2)
Level 4, Seminar Room 4-4
Singapore Management University
90 Stamford Road,
Singapore 178903 Please register by 23 April 2025.  |
|
About the Talk It is often easy to write down the specification of a system as a relation between inputs and outputs. But implementing the system is a functional problem: to provide functions that produce outputs from inputs. The question we ask is if we can automatically synthesize such a function from the given relation? This question has generated a lot of interest in recent years, especially in the Boolean setting, where despite theoretical hardness results, many techniques and tools have been developed that now scale surprisingly well. In this talk, we shine a light on this problem from a Knowledge Representation perspective. We identify structural properties and develop normal forms for the specification that guarantee provably efficient synthesis. Further, we move towards a characterization of what makes Boolean functional synthesis easy and examine techniques to compile into such forms. About the Speaker S. Akshay is a Professor in the Department of Computer Science and Engineering at IIT Bombay, where he holds the Shridhar Shukla Chair for Digital Trust. His research interests span formal methods and AI with a focus on quantitative (timed/probabilistic) verification, automata theory and automated synthesis. He has given multiple invited talks and tutorials on functional synthesis in venues including Highlights 2022, AAAI 2022 and IJCAI 2022 as well as organized workshops on various topics ranging from Trustworthy AI to Functional Synthesis and Automata, Concurrency and Timed systems. |
