University of Cambridge > Talks.cam > Microsoft Research Cambridge, general interest public talks > From Verification to Synthesis

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

From Verification to Synthesis

Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins .

Abstract: One of the most significant developments in the area of design verification over the last decade is the development of algorithmic methods for verifying temporal specification of finite-state designs. A frequent criticism against this approach, however, is that verification is done after significant resources have already been invested in the development of the design. Since designs invariably contains errors, verification simply becomes part of the debugging process. The critics argue that the desired goal is to use the specification in the design development process in order to guarantee the development of correct designs. This is called design synthesis. In this talk I will review 50 years of research on the synthesis problem, describe the automata-theoretic approach developed to solve this problem, and address current challenges.

Host: Byron Cook – Microsoft Research Ltd

This talk is part of the Microsoft Research Cambridge, general interest public talks series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Gonville and Caius College Main Lecture Theatre, Old Divinity School, St John's College, Cambridge Ienter from All Saints' Passage" Hodgkin-Huxley Seminat Room, Physiology Building

Other talks

Title and abstract tba The Play Paradox: How video games build better humans Title to be confirmed Talk TBC Director's Briefing How bubble acoustics can help in three apocalypses
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity