University of Cambridge > > Microsoft Research Cambridge, public talks > A Collapsible Approach to Higher Order Verification

A Collapsible Approach to Higher Order Verification

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 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

Higher-order features are becoming increasingly commonplace in industrial programming languages, e.g. the introduction of lambda expressions to C++, the popularity of Scala, or the understated appearance of functions as data in scripting languages such as Python. My research has focussed on extending automata-based verification techniques to be able to reason about higher-order function calls.

I will give an overview of the kinds of automata we use, and how they relate to higher-order programs, and give an overview of the current state of the art in verification tools for higher-order programs. I will then consider the introduction of concurrent features to higher-order programs, and describe the kinds of approaches taken so far.

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-2018, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity