A parametric abstract domain for lattice-valued regular expressions

Jan Midtgaard*, Flemming Nielson, Hanne Riis Nielson

*Kontaktforfatter for dette arbejde

Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Abstrakt

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.

OriginalsprogEngelsk
TitelStatic Analysis - 23rd International Symposium, SAS 2016, Proceedings
ForlagSpringer
Publikationsdato1. jan. 2016
Sider338-360
ISBN (Trykt)9783662534120
DOI
StatusUdgivet - 1. jan. 2016
Udgivet eksterntJa
Begivenhed23rd International Symposium on Static Analysis, SAS 2016 - Edinburgh, Storbritannien
Varighed: 8. sep. 201610. sep. 2016

Konference

Konference23rd International Symposium on Static Analysis, SAS 2016
LandStorbritannien
ByEdinburgh
Periode08/09/201610/09/2016
NavnLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Vol/bind9837 LNCS
ISSN0302-9743

Fingeraftryk

Dyk ned i forskningsemnerne om 'A parametric abstract domain for lattice-valued regular expressions'. Sammen danner de et unikt fingeraftryk.

Citationsformater