Abstract
We present a lattice-valued generalization of regular expressions as an abstract domain for static analysis. The parametric abstract domain rests on a generalization of Brzozowski derivatives and works for both finite and infinite lattices. We develop both a co-inductive, simulation algorithm for deciding ordering between two domain elements and a widening operator for the domain. Finally we illustrate the domain with a static analysis that analyses a communicating process against a lattice-valued regular expression expressing the environment’s network communication.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 23rd International Symposium on Static Analysis (SAS 2016) |
| Editors | Xavier Rival |
| Publisher | Springer |
| Publication date | 2016 |
| Pages | 338-360 |
| ISBN (Print) | 978-3-662-53412-0 |
| ISBN (Electronic) | 978-3-662-53413-7 |
| Publication status | Published - 2016 |
| Event | 23rd International Symposium on Static Analysis - Edinburgh, United Kingdom Duration: 8 Sept 2016 → 10 Sept 2016 Conference number: 23 http://staticanalysis.org/sas2016/ |
Conference
| Conference | 23rd International Symposium on Static Analysis |
|---|---|
| Number | 23 |
| Country/Territory | United Kingdom |
| City | Edinburgh |
| Period | 08/09/2016 → 10/09/2016 |
| Internet address |
| Series | Lecture Notes in Computer Science |
|---|---|
| Volume | 9837 |
| ISSN | 0302-9743 |