-
Verification, Model Checking, and Abstract Interpretation - 13th International Conference, VMCAI 2012, Philadelphia, PA, USA, January 22-24, 2012. Proceedings; 01/2012
-
European Conference on Computer Systems, Proceedings of the Sixth European conference on Computer systems, EuroSys 2011, alzburg, Austria - April 10-13, 2011; 01/2011
-
[show abstract]
[hide abstract]
ABSTRACT: Shape analysis is a promising technique to prove program properties about recursive data structures. The challenge is to automatically
determine the data-structure type, and to supply the shape analysis with the necessary information about the data structure.
We present a stepwise approach to the selection of instrumentation predicates for a TVLA-based shape analysis, which takes
us a step closer towards the fully automatic verification of data structures. The approach uses two techniques to guide the
refinement of shape abstractions: (1)during program exploration, an explicit heap analysis collects sample instances of the
heap structures, which are used to identify the data structures that are manipulated by the program; and (2)during abstraction
refinement along an infeasible error path, we consider different possible heap abstractions and choose the coarsest one that
eliminates the infeasible path. We have implemented this combined approach for automatic shape refinement as an extension
of the software model checker BLAST. Example programs from a data-structure library that manipulate doubly-linked lists and
trees were successfully verified by our tool.
03/2010: pages 263-277;
-
Proceedings of the 10th International conference on Embedded software, EMSOFT 2010, Scottsdale, Arizona, USA, October 24-29, 2010; 01/2010
-
Fundamental Approaches to Software Engineering, 13th International Conference, FASE 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings; 01/2010
-
Foundations of Software Science and Computational Structures, 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings; 01/2010
-
IEEE International Conference on Cloud Computing, CLOUD 2010, Miami, FL, USA, 5-10 July, 2010; 01/2010
-
Computer Aided Verification, 20th International Conference, CAV 2008, Princeton, NJ, USA, July 7-14, 2008, Proceedings; 01/2008
-
[show abstract]
[hide abstract]
ABSTRACT: We explore the border between decidability and undecidability of verification problems related to message passing systems that admit unbounded creation of threads and name mobility. Inspired by use cases in real-life programs we introduce the notion of depth-bounded message passing systems. A configuration of a message passing system can be represented as a graph. In a depth-bounded system the length of the longest acyclic path in each reachable configuration is bounded by a constant. While the general reachability problem for depth-bounded systems is undecidable, we prove that control reachability is decidable. In our decidability proof we show that depth-bounded systems are well-structured transition systems to which a forward algorithm for the covering problem can be applied.
-
[show abstract]
[hide abstract]
ABSTRACT: Shape analysis is a promising technique to prove program properties about recursive data structures. The challenge is to automatically determine the data-structure type, and to supply the shape analysis with the necessary information about the data structure. We present a stepwise approach to the selection of instrumentation predicates for a TVLA-based shape analysis, which takes us a step closer towards the fully automatic verification of data structures. The approach uses two techniques to guide the refinement of shape abstractions: (1) during program exploration, an explicit heap analysis collects sample instances of the heap structures, which are used to identify the data structures that are manipulated by the program; and (2) during abstraction refinement along an infeasible error path, we consider different possible heap abstractions and choose the coarsest one that eliminates the infeasible path. We have implemented this combined approach for automatic shape refinement as an extension of the software model checker BLAST. Example programs from a data-structure library that manipulate doubly-linked lists and trees were successfully verified by our tool.
