A Parametric Abstract Domain for Lattice-Valued Regular Expressions

Midtgaard, Jan; Nielson, Flemming; Nielson, Hanne Riis

doi:10.1007/978-3-662-53413-7_17

Cited by 9 publications

(13 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To analyze the network communication and content we will use the domain of latticevalued regular expressions (LVREs) [Logozzo, 2004, Midtgaard et al, 2016b. We recall here the basics of LVREs (sans complement as it is irrelevant for the problem at hand).…”

Section: Lattice-valued Regular Expressionsmentioning

confidence: 99%

“…They also have the consequence that γ is strict (γ(⊥) = ∅), that α : Atoms(℘(C)) −→ Atoms(A) is surjective (we have an atomistic Galois insertion), and that A's atoms have no overlapping meaning (∀a, a ′ . a = a ′ =⇒ γ(a) ∩ γ(a ′ ) = ∅) [Midtgaard et al, 2016b]. We give meaning to the LVREs relative to the γ of the given Galois insertion.…”

Section: Fig 6: the Brzozowski Derivative Of Lattice-valued Regular mentioning

confidence: 99%

“…Like our approach it may need to reanalyze each thread repeatedly. In previous work we developed LVREs, including an ordering algorithm and a widening operator [Midtgaard et al, 2016b] and illustrated the domain with an intra-process analysis over LVRE futures. In a follow-up paper [Midtgaard et al, 2016a] we refined this idea to an inter-process analysis with LVREs for both histories and futures, albeit limited to two synchronous processes.…”

Section: Soundness Of Iterative Approachmentioning

confidence: 99%

“…For one, he defines L(ǫ) = ∅ which is algebraically controversial. For another, his structural widening operator was too sensitive to syntactic variations and did not satisfy the classical widening definition [Midtgaard et al, 2016b].…”

Section: Soundness Of Iterative Approachmentioning

confidence: 99%

“…We assume the reader is familiar with lattice theory [Grätzer, 1978, Davey andPriestley, 2002] and abstract interpretation Cousot, 1977, 1979], and only recall the more specialized and recent material on the abstract domain of lattice-valued regular expressions [Midtgaard et al, 2016b].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Process-Local Static Analysis of Synchronous Processes

Midtgaard

Nielson

2018

Static Analysis

Self Cite

View full text Add to dashboard Cite

We develop a modular approach to statically analyse imperative processes communicating by synchronous message passing. The approach is modular in that it only needs to analyze one process at a time, but will in general have to do so repeatedly. The approach combines lattice-valued regular expressions to capture network communication with a dedicated shuffle operator for composing individual process analysis results. We present both a soundness proof and a prototype implementation of the approach for a synchronous subset of the Go programming language. Overall our approach tackles the combinatorial explosion of concurrent programs by suitable static analysis approximations, thereby lifting traditional sequential analysis techniques to a concurrent setting.

show abstract

Section: Lattice-valued Regular Expressionsmentioning

confidence: 99%

Section: Fig 6: the Brzozowski Derivative Of Lattice-valued Regular mentioning

confidence: 99%

Section: Soundness Of Iterative Approachmentioning

confidence: 99%

Section: Soundness Of Iterative Approachmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Process-Local Static Analysis of Synchronous Processes

Midtgaard

Nielson

2018

Static Analysis

Self Cite

View full text Add to dashboard Cite

show abstract

Twinning Automata and Regular Expressions for String Static Analysis

Negrini

Arceri

Ferrara

et al. 2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper we formalize Tarsis, a new abstract domain based on the abstract interpretation theory that approximates string values through finite state automata. The main novelty of Tarsis is that it works over an alphabet of strings instead of single characters. On the one hand, such an approach requires a more complex and refined definition of the widening operator, and the abstract semantics of string operators. On the other hand, it is in position to obtain strictly more precise results than state-of-the-art approaches. We implemented a prototype of Tarsis, and we applied it to some case studies taken from some of the most popular Java libraries manipulating string values. The experimental results confirm that Tarsis is in position to obtain strictly more precise results than existing analyses.

show abstract

A Product of Shape and Sequence Abstractions

Giet,

Ridoux,

Rival

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Traditional separation logic-based shape analyses utilize inductive summarizing predicates so as to capture general properties of the layout of data-structures, to verify accurate manipulations of, e.g., various forms of lists or trees. However, they also usually abstract away contents properties, so that they may only verify memory safety and invariance of data-structure shapes. In this paper, we introduce a novel abstract domain to describe sequences of values of unbounded size, and track constraints on their length and on extremal values contained in them. We define a reduced product of such a sequence abstraction together with an existing shape abstraction so as to infer both shape and contents properties of data-structures. We report on the implementation of the sequence domain, its integration into a static analyzer for C code, and we evaluate its ability to verify partial functional correctness properties for list and tree algorithms.

show abstract

A Parametric Abstract Domain for Lattice-Valued Regular Expressions

Cited by 9 publications

References 33 publications

Process-Local Static Analysis of Synchronous Processes

Process-Local Static Analysis of Synchronous Processes

Twinning Automata and Regular Expressions for String Static Analysis

A Product of Shape and Sequence Abstractions

Contact Info

Product

Resources

About