University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Algebra of Parameterised Graphs

Algebra of Parameterised Graphs

Add to your list(s) Download to your calendar using vCal

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

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

What happens if you spill a bucket of predicates over a graph? You get what I call a parameterised graph—a mathematical beauty with interesting properties and applications. In this talk I will define parameterised graphs algebraically and will show you how to use them for succinct specification, verification and synthesis of concurrent systems, with examples coming from hardware and software engineering. I will conclude by highlighting several questions about parameterised graphs that I don’t have an answer for, hopefully getting fresh insights from the audience.

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

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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