Bug Finding Techniques for Programs with Infinitely Many States

Speaker  Pierre Ganty

Host  Shaz Qadeer

Affiliation  IMDEA Software Institute

Duration  00:47:59

Date recorded  7 December 2012

I will introduce a bug finding technique for concurrent programs over a finitized data domain and a general framework for underapproximations arising from it. Then, I will move to sequential recursive programs over the integers and present a novel underapproximation technique capturing executions with unbounded stack usage. All those algorithmic techniques distinguish by offering extended coverage compared to the state-of-the-art.

©2012 Microsoft Corporation. All rights reserved.
> Bug Finding Techniques for Programs with Infinitely Many States