Static Analysis of Communicating Processes using Symbolic Transducers
Vincent Botbol, Emmanuel Chailloux, Tristan Le Gall

TL;DR
This paper introduces a static analysis framework for communicating processes using symbolic transducers and lattice automata, enabling safety verification of dynamic systems with process creation and communication.
Contribution
It presents a novel model combining abstract interpretation with symbolic transducers and lattice automata for analyzing systems of communicating processes.
Findings
Provides sound over-approximation of reachability sets
Successfully implemented for MPI C programs
Enables safety property verification in dynamic process systems
Abstract
We present a general model allowing static analysis based on abstract interpretation for systems of communicating processes. Our technique, inspired by Regular Model Checking, represents 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 thus allowing us to prove safety properties. We implemented this method in a prototype that targets the MPI library for C programs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Security and Verification in Computing · Logic, programming, and type systems
