AbstractWe present UppDMC, a distributed model-checking tool. It is tailored for checking finite-state systems and μ-calculus specifications with at most one alternation of minimal and maximal fixed-point operators. This fragment is also known as Lμ2. Recently, efficient game-based algorithms for this logic have been outlined.We describe the implementation of these algorithms within UppDMC and study their performance on practical examples. Running UppDMC on a simple workstation cluster, we were able to check liveness properties of the largest examples given in the VLTS Benchmark Suite, for which no answers were previously known
Abstract. This work extends the game-based framework of µ-calculus model checking to the multi-value...
AbstractIn this work we extend the approach used in [6] to perform distributed-memory AFMC model che...
Abstract. This paper analyses the complexity of model checking Fix-point Logic with Chop – an extens...
AbstractWe present UppDMC, a distributed model-checking tool. It is tailored for checking finite-sta...
In this thesis we investigate how the known framework of automatic formal verification by model chec...
AbstractWe describe a parallel model-checking algorithm for the fragment of the μ-calculus that allo...
AbstractThis work extends the game-based framework of μ-calculus model checking to the multi-valued ...
The explicit-state analysis of concurrent systems must handle large state spaces, which correspond t...
The logic considered in this paper is FLC, fixed point logic with chop. It is an extension of modal...
In today's computer engineering, requirements for generally high reliability have pushed the notion ...
2 Abstract This dissertation deals with a number of algorithmic problems motivated bycomputer aided ...
Computer programs keep finding their ways into new safety-critical applications, while at the same t...
This paper analyses the complexity of model checking fixpoint logic with Chop – an extension of the ...
In this paper, we introduce model-checking games that allow local second-order power on sets of inde...
AbstractIn this paper, we introduce model-checking games that allow local second-order power on sets...
Abstract. This work extends the game-based framework of µ-calculus model checking to the multi-value...
AbstractIn this work we extend the approach used in [6] to perform distributed-memory AFMC model che...
Abstract. This paper analyses the complexity of model checking Fix-point Logic with Chop – an extens...
AbstractWe present UppDMC, a distributed model-checking tool. It is tailored for checking finite-sta...
In this thesis we investigate how the known framework of automatic formal verification by model chec...
AbstractWe describe a parallel model-checking algorithm for the fragment of the μ-calculus that allo...
AbstractThis work extends the game-based framework of μ-calculus model checking to the multi-valued ...
The explicit-state analysis of concurrent systems must handle large state spaces, which correspond t...
The logic considered in this paper is FLC, fixed point logic with chop. It is an extension of modal...
In today's computer engineering, requirements for generally high reliability have pushed the notion ...
2 Abstract This dissertation deals with a number of algorithmic problems motivated bycomputer aided ...
Computer programs keep finding their ways into new safety-critical applications, while at the same t...
This paper analyses the complexity of model checking fixpoint logic with Chop – an extension of the ...
In this paper, we introduce model-checking games that allow local second-order power on sets of inde...
AbstractIn this paper, we introduce model-checking games that allow local second-order power on sets...
Abstract. This work extends the game-based framework of µ-calculus model checking to the multi-value...
AbstractIn this work we extend the approach used in [6] to perform distributed-memory AFMC model che...
Abstract. This paper analyses the complexity of model checking Fix-point Logic with Chop – an extens...