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.
CITATION STYLE
Midtgaard, J., Nielson, F., & Nielson, H. R. (2016). A parametric abstract domain for lattice-valued regular expressions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9837 LNCS, pp. 338–360). Springer Verlag. https://doi.org/10.1007/978-3-662-53413-7_17
Mendeley helps you to discover research relevant for your work.