A recent line of work lifts particular verification and analysis methods to Software Product
Lines (SPL). In an effort to generalize such case-by-case approaches, we develop a …

Path problems in graphs can be solved by abstraction of a fixpoint definition of all paths in a
finite graph. Applied to the Roy-Floyd-Warshall shortest path algorithm this yields a naïve n 4 …

A recent line of work lifts particular verification and analysis methods to Software Product
Lines (SPL). In an effort to generalize such case-by-case approaches, we develop a …

Galois connections are a foundational tool for structuring abstraction in semantics and their
use lies at the heart of the theory of abstract interpretation. Yet, mechanization of Galois …

It is important when developing software to verify the absence of undesirable behavior such
as crashes, bugs and security vulnerabilities. Some settings require high assurance in …

Towards the characteristics of port monitoring and the particularity of network environment,
an optimized wireless sensor network (WSN) topology based on small-world network was …

Galois connections are a foundational tool for structuring abstraction in semantics, and their
use lies at the heart of the theory of abstract interpretation. Yet, mechanization of Galois …

Calculational abstract interpretation, long advocated by Cousot, is a technique for deriving
correct-by-construction abstract interpreters from the formal semantics of programming …

The aim of this study is to analyse dynamic programming in large scale, complex networks is
more important in the fields of scientific and engineering. Recent applications needs the …

In my research, which falls in the area of programming languages design and
implementation, I am mostly interested in the design of scalable, robust, and intellectually …