thesis published Damien Zufferey author 4397AC76-F248-11E8-B48F-1D18A9856A870000-0002-3197-8736 Thomas A Henzinger supervisor ToHe department GradSch department Rigorous Systems Engineering project Quantitative Reactive Modeling project 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. Downward-closed 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 over-approximates 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. https://research-explorer.ista.ac.at/download/1405/9176/2013_Zufferey_thesis_final.pdf application/pdfno https://research-explorer.ista.ac.at/download/1405/10298/2013_Zufferey_thesis_final_pdfa.pdf application/pdf Institute of Science and Technology Austria2013 eng 2663-337X10.15479/at:ista:1405 134 https://research-explorer.ista.ac.at/record/4361 https://research-explorer.ista.ac.at/record/3251 https://research-explorer.ista.ac.at/record/2847 Zufferey, D. (2013). <i>Analysis of dynamic message passing programs</i>. Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/at:ista:1405">https://doi.org/10.15479/at:ista:1405</a> Zufferey, Damien. “Analysis of Dynamic Message Passing Programs.” Institute of Science and Technology Austria, 2013. <a href="https://doi.org/10.15479/at:ista:1405">https://doi.org/10.15479/at:ista:1405</a>. D. Zufferey, “Analysis of dynamic message passing programs,” Institute of Science and Technology Austria, 2013. Zufferey D. Analysis of dynamic message passing programs. 2013. doi:<a href="https://doi.org/10.15479/at:ista:1405">10.15479/at:ista:1405</a> Zufferey, Damien. <i>Analysis of Dynamic Message Passing Programs</i>. Institute of Science and Technology Austria, 2013, doi:<a href="https://doi.org/10.15479/at:ista:1405">10.15479/at:ista:1405</a>. Zufferey D. 2013. Analysis of dynamic message passing programs. Institute of Science and Technology Austria. D. Zufferey, Analysis of Dynamic Message Passing Programs, Institute of Science and Technology Austria, 2013. 14052018-12-11T11:51:50Z2025-04-15T08:11:54Z