A Constraint-Programming Framework For Bounded Program Verification

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

• Helene Collavizza (Ecole Polytechnique Universitaire de Nice Sophia Antipolis)
• Tuesday 11 March 2008, 13:00-14:00
• Computer Laboratory, William Gates Building, Room SS03.

If you have a question about this talk, please contact Thomas Tuerk.

Speaker: Helene Collavizza

In this talk, we will present a framework for verifying the conformity of a program with its specification using constraint programming. This framework uses constraints to represent sets of memory stores and explores execution paths over these constraint stores. The input program is partially correct if each constraint store produced by constraint-based execution implies the postcondition. One main benefit of this approach is that it does not explore spurious execution paths as it incrementally prunes paths by an early detection of inconsistent constraint stores. We will present the approach, then introduce constraint programming, and then illustrate the framework on a number of examples to highlight its functionalities and give some preliminary performance results.

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Computer Laboratory Automated Reasoning Group Lunches
• Computer Laboratory talks
• Computer Laboratory, William Gates Building, Room SS03
• School of Technology

Note that ex-directory lists are not shown.