Analysis of dynamic message passing programs
By: Zufferey, Damien.Material type: BookPublisher: IST Austria 2013
|Item type||Current location||Call number||Status||Date due||Barcode||Item holds|
1 Introduction, motivation, and related work
2 Toward a forward analysis of depth-bounded systems: domain of limits
3 Bridging the gap between theory and practice: ideal abstraction
4 Implementation: Picasso
5 Extensions: termination of depth-bounded systems, dynamic package interfaces
Motivated by the analysis of highly dynamic message-passing systems, i.e. unbounded thread creation, mobility, etc. We present a framework for the analysis of depth-bounded systems. Depth-bounded systems are one of the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. Even though they are infinite state systems depth-bounded
systems are well-structured, thus can be analyzed algorithmically. We give an interpretation of depth-bounded systems as graph-rewriting systems. This gives more flexibility and ease of use to apply depth-bounded systems to other type
of systems like shared memory concurrency.
First, we develop an adequate domain of limits for depth-bounded systems, a prerequisite for the effective representation of downward-closed sets. Downwardclosed sets are needed by forward saturation-based algorithms to represent potentially infinite sets of states. Then, we present an abstract interpretation framework to compute the covering set of well-structured transition systems. Because, in general, the covering set is not computable, our abstraction overapproximates the actual covering set. Our abstraction captures the essence of acceleration based-algorithms while giving up enough precision to ensure convergence. We have implemented the analysis in the Picasso tool and show that it
is accurate in practice. Finally, we build some further analyses like termination using the covering set as starting point.