Static Analysis of Communicating Process using Symbolic Transducers
We present a general model allowing static analysis based on abstract interpretation for systems of communicating processes. Our technique, inspired by Regular Model Checking, represent set of program states as lattice automata and programs semantics as symbolic transducers. This model can express dynamic creation/destruction of processes and communications. Using the abstract interpretation framework, we are able to provide a sound over-approximation of the reachability set of the system and therefore allowing us to prove safety properties. We implemented this method in a prototype that targets the MPI library for C programs.
Sun 15 Jan Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
14:00 - 15:30
|Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms|
|Independence Abstractions and Models of Concurrency|
|Static Analysis of Communicating Process using Symbolic Transducers|
Vincent BotbolCEA LIST + LIP6 Université Pierre & Marie Curie, Tristan Le GallCEA LIST, Emmanuel ChaillouxLIP6 - UPMCMedia Attached File Attached