In this paper we develop an approach to model-checking for timed automata via reachability
testing. As our specification formalism, we consider a dense-time property language with …

The computational engine of the verification tool UPPAAL consists of a collection of efficient
algorithms for the analysis of reachability properties of systems. Model-checking of …

In this paper we present loose programming, an approach designed to enable process
developers to design their application-specific processes in an intuitive style. Key to this …

We study information flow security in the setting of mobile agents. We propose a sufficient
condition to security named Persistent_BNDC. A process is Persistent_BNDC when every of …

Monitorability underpins the technique of runtime verification because it delineates what
properties can be verified at runtime. Although many monitorability definitions exist, few are …

Monitorability underpins the technique of Runtime Verification because it delineates what
properties can be verified at runtime. Although many monitorability definitions exist, few are …

This book addresses the challenge of user-level workflow design with a particular focus on
the bioinformatics application domain. Towards this aim, it follows a novel, constraint-driven …

Some of the non-interference properties studied in (Focardi, 1998; Focardi and Gorrieri,
1995) for information flow analysis in computer systems, notably BNDC, are reformulated in …

Constraint-based variability modeling is a flexible, declarative approach to managing
solution-space variability. Product variants are defined in a top-down manner by …

In previous work, we studied some noninterference properties for information flow analysis
in computer systems on classic (possibilistic) labeled transition systems. In this paper, some …