|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
A Constraint-Programming Framework For Bounded Program Verification
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:
Note that ex-directory lists are not shown.
Other listsFaraday Institute Explore Islam Cambridge Events Cambridge Immunology
Other talksIn Situ Hybridisation Symposium 2013 Drosophila as a model to study innate immunity Transient responses of the Southern Ocean to climate change Autumn Cactus & Succulent Show “The Impact of Impact: The future of science funding” Curve fitting, errors and analysis of binding data