Symbolic Shape Analysis

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

• Thomas Wies, EPFL
• Thursday 23 April 2009, 11:30-12:00
• Small Lecture Room, Microsoft Research, Roger Needham Building, 7 J J Thomson Avenue, Cambridge CB3 0FB.

If you have a question about this talk, please contact Dr Fabien Petitcolas.

Abstract: Shape analysis refers to a range of program analyses that target properties of linked heap-allocated data structures. Symbolic Shape Analysis uses logical formulae to represent sets of graph-like states. As in three-valued shape analysis, an abstract domain is specified by predicates on heap objects. Symbolic Shape Analysis improves upon existing shape analyses in terms of degree of automation. It uses decision procedures in order to automatically construct abstract transformers and to automatically refine the abstraction based on spurious counterexamples.

Biography: Thomas Wies recently finished his Ph.D. studies at the University of Freiburg, Germany. He was supported by a Microsoft European Ph.D. Scholarship. Thomas is now a postdoctoral researcher at EPFL , Switzerland. His research focusses on program analysis and verification. Specifically, he is interested in automated abstraction, abstraction refinement, and applications of automated reasoning in the context of software verification.

This talk is part of the Dr Fabien Petitcolas's list series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Guy Emerson's list
• Interested Talks
• Microsoft Research Cambridge, public talks
• Microsoft Research PhD Scholars
• Optics for the Cloud
• PMRFPS's
• School of Technology
• Small Lecture Room, Microsoft Research, Roger Needham Building, 7 J J Thomson Avenue, Cambridge CB3 0FB
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• personal list
• rp587

Note that ex-directory lists are not shown.