Abstract
We present an iterated approach to statically analyze programs of two processes communicating by message passing. Our analysis operates over a domain of lattice-valued regular expressions, and computes increasingly better approximations of each process's communication behavior. Overall the work extends traditional semantics-based program analysis techniques to automatically reason about message passing in a manner that can simultaneously analyze both values of variables as well as message order, message content, and their interdependencies.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming (PPDP '16) |
| Publisher | Association for Computing Machinery |
| Publication date | 2016 |
| Pages | 132-145 |
| ISBN (Print) | 978-1-4503-4148-6 |
| DOIs | |
| Publication status | Published - 2016 |
| Event | 18th International Symposium on Principles and Practice of Declarative Programming - Edinburgh, United Kingdom Duration: 5 Sept 2016 → 11 Sept 2016 Conference number: 18 http://conferences.inf.ed.ac.uk/ppdp-lopstr-sas-2016/ |
Conference
| Conference | 18th International Symposium on Principles and Practice of Declarative Programming |
|---|---|
| Number | 18 |
| Country/Territory | United Kingdom |
| City | Edinburgh |
| Period | 05/09/2016 → 11/09/2016 |
| Internet address |
Keywords
- Process analysis
- Abstract interpretation
- Lattice-valued regular expressions