Presentation of the 9th edition of the model checking contest
Abstract The Model Checking Contest (MCC) is an annual competition of software tools for
model checking. Tools must process an increasing benchmark gathered from the whole …
model checking. Tools must process an increasing benchmark gathered from the whole …
Dependency graphs with applications to verification
S Enevoldsen, KG Larsen, A Mariegaard… - International Journal on …, 2020 - Springer
Dependency graphs, as introduced more than 20 years ago by Liu and Smolka, are oriented
graphs with hyperedges that connect nodes with sets of target nodes in order to represent …
graphs with hyperedges that connect nodes with sets of target nodes in order to represent …
Partial order reduction for reachability games
Partial order reductions have been successfully applied to model checking of concurrent
systems and practical applications of the technique show nontrivial reduction in the size of …
systems and practical applications of the technique show nontrivial reduction in the size of …
Stubborn set reduction for two-player reachability games
Partial order reductions have been successfully applied to model checking of concurrent
systems and practical applications of the technique show nontrivial reduction in the size of …
systems and practical applications of the technique show nontrivial reduction in the size of …
Abstract dependency graphs and their application to model checking
S Enevoldsen, K Guldstrand Larsen, J Srba - … TACAS 2019, Held as Part of …, 2019 - Springer
Dependency graphs, invented by Liu and Smolka in 1998, are oriented graphs with
hyperedges that represent dependencies among the values of the vertices. Numerous …
hyperedges that represent dependencies among the values of the vertices. Numerous …
Extended abstract dependency graphs
Dependency graphs, invented by Liu and Smolka in 1998, are oriented graphs with
hyperedges that represent dependencies among the values of the vertices. Numerous …
hyperedges that represent dependencies among the values of the vertices. Numerous …
Symbolic model checking of weighted PCTL using dependency graphs
M Claus Jensen, A Mariegaard… - … TX, USA, May 7–9, 2019 …, 2019 - Springer
We present a global and local algorithm for model checking a weighted variant of PCTL with
upper-bound weight constraints, on probabilistic weighted Kripke structures where the …
upper-bound weight constraints, on probabilistic weighted Kripke structures where the …
Elimination of Detached Regions in Dependency Graph Verification
The formalism of dependency graphs by Liu and Smolka is a well-established method for on-
the-fly computation of fixed points over Boolean domains with numerous applications in eg …
the-fly computation of fixed points over Boolean domains with numerous applications in eg …
Model verification through dependency graphs
S Enevoldsen, K Guldstrand Larsen, J Srba - Model Checking Software …, 2019 - Springer
Dependency graphs, as introduced more than 20 years ago by Liu and Smolka, are oriented
graphs with hyperedges that connect nodes with sets of target nodes in order to represent …
graphs with hyperedges that connect nodes with sets of target nodes in order to represent …
Check for Elimination of Detached Regions in Dependency Graph Verification Peter Gjøl Jensen, Kim Guldstrand Larsen, Jiří Srba, and Nikolaj Jensen Ulrik ()
PG Jensen - … Software: 29th International Symposium, SPIN 2023 …, 2023 - books.google.com
The formalism of dependency graphs by Liu and Smolka is a well-established method for on-
the-fly computation of fixed points over Boolean domains with numerous applications in eg …
the-fly computation of fixed points over Boolean domains with numerous applications in eg …