A Collapsible Approach to Higher Order Verification

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

• Matthew Hague, Royal Holloway University of London
• Thursday 22 May 2014, 15:00-16:00
• Auditorium, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB.

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

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.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Auditorium, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Guy Emerson's list
• Interested Talks
• Microsoft Research Cambridge, public talks
• Optics for the Cloud
• PMRFPS's
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• personal list
• rp587

Note that ex-directory lists are not shown.