BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:QUIC Graphs: Relational Invariant Generation for Containers - Arle
 n Cox\, University of Colorado Boulder/ENS Paris
DTSTART:20130913T150000Z
DTEND:20130913T160000Z
UID:TALK47023@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:Programs written in modern languages perform intricate manipul
 ations of containers such as arrays\, lists\, dictionaries\, and sets. We 
 present an abstract interpretation-based framework for automatically infer
 ring relations between the set of values stored in these containers. Relat
 ions include inclusion relations over unions and intersections\, as well a
 s quantified relationships with scalar variables. We develop an abstract d
 omain constructor that builds a container domain out of a Quantified Union
 -Intersection Constraint (QUIC) graph parameterized by an arbitrary base d
 omain. We instantiate our domain with a polyhedral base domain and evaluat
 e it on programs extracted from the Python test suite. Over traditional\, 
 non-relational domains\, we find significant precision improvements with m
 inimal performance cost.
LOCATION:Auditorium\, Microsoft Research Ltd\, 21 Station Road\, Cambridge
 \, CB1 2FB
END:VEVENT
END:VCALENDAR