Probabilistic model checking (PMC) is a well-established method for the quantitative
analysis of dynamic systems. Description logics (DLs) provide a well-suited formalism to …

Model‐checking enables the automated formal verification of software systems through the
explicit enumeration of all the reachable states. While this technique has been successfully …

Probabilistic model checking (PMC) is a well-established method for the quantitative
analysis of state based operational models such as Markov decision processes. Description …

With an ever increasing complexity, the verification of critical embedded systems is a
challenging and expensive task. Among the available formal methods, model checking …

When verifying C code, two major problems must be addressed. One is the specification of
the verified systems properties, the other one is the construction of the verification …

Despite the high level of automation, the practicability of formal verification through model-
checking of large models is hindered by the combinatorial explosion problem. In this paper …

Abstract Information security was initially required in specific applications, however,
nowadays, most companies and even individuals are interested in securing their information …

Despite the high-level of automation, the practicability of model-checking large
asynchronous models is hindered by the state-space explosion problem. To address this …

The modelling of access control (AC) policies aim to describe aspects of different security
requirements at a higher level of abstraction. Once the AC policy has been modelled, the …

Model checking is a well-known method to verify a formal model in all possible
configurations. Nevertheless this technique can hardly scale up to industrial asynchronous …