Matthew Parkinson

Name:	Matthew Parkinson
Affiliation:	University of Cambridge
E-mail:	(only provided to users who are logged into talks.cam)
Last login:	15 Jul 2010, 10:44 a.m.

Public lists managed by Matthew Parkinson

• Program verification reading group.

Talks given by Matthew Parkinson

Obviously this only lists talks that are listed through talks.cam. Furthermore, this facility only works if the speaker's e-mail was specified in a talk. Most talks have not done this.

Talks organised by Matthew Parkinson

This list is based on what was entered into the 'organiser' field in a talk. It may not mean that Matthew Parkinson actually organised the talk, they may have been responsible only for entering the talk into the talks.cam system.

• Automatic Analysis of Scratch-pad Memory Code for Heterogeneous Multicore Processors
• The Hybrid Systems Jigsaw: Bringing Together Computer Science, Dynamical Systems and Control Engineering.
• A Theory of Indirection via Approximation
• A Canonical Local Representation of Binding
• Semantics lunch organisational meeting
• Dependent Types for Low-Level Programming.
• Secure Compilation of a Multi-Tier
• Boogie: A Modular Reusable Verifier for Object-Oriented Programs.
• Title to be confirmed
• Convergence of path-finding
• Compiling Functional Types to Relational Specifications for Low Level Imperative Code
• Some notes on syntactic logical relations for pure System F
• Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
• Deny-guarantee reasoning
• Deny-guarantee reasoning
• Focusing on Pattern Matching
• An Invitation to Nominal Domain Theory
• Classical BI (A Logic for Reasoning About Dualising Resource)
• Nominal terms and one-and-a-half level Curry-Howard
• Event structure semantics of the pi-calculus
• Verification Based on Algebra and Automated Deduction
• A language extension for provably safe exception handling
• Keep Off The Grass: Locking the Right Path for Atomicity
• On Scalable Shape Analysis
• Separation Logic Semantics for Communicating Processes
• Pointer Safety and Graph Grammars
• Model theoretic tools for deciding boundedness of fixed points
• Logical Reasoning for Higher-Order Functions with Local State
• A unified model of class invariant verification frameworks
• Cyclic Proofs of Program Termination in Separation Logic
• Relational parametricity for computational effects.
• Title to be confirmed
• A Logic of Reachable Patterns in Linked Data-Structures
• Verifying Object-Invariants in Spec#