Ctrl K

Artifact for the Paper "Fast Verified SCCs for Probabilistic Model Checking"

Artifact for the Paper "Fast Verified SCCs for Probabilistic Model Checking"

2
mentions
3
contributors

Description

The artifact that backs up the data in our ATVA 2023 Paper titled "Fast Verified SCCs for Probabilistic Model Checking". This artifact contains the proof files for Isabelle/HOL. Running the proofs yields a LLVM implementation of Gabow's algorithm that can be compiled to a dynamic library. This artifact also contains a version of the Modest toolset that can use this library to replace the built-in SCC algorithm. Lastly, the artifact contains scripts that reproduce the results in the paper. The additional reference contains a link to browsable version of the artifact that allows proofs to be inspected without downloading anything.

Logo of Artifact for the Paper "Fast Verified SCCs for Probabilistic Model Checking"
Keywords
Correct-by-construction
Gabow
IRF
Isabelle/HOL
Isabelle Refinement Framework
Linear programming
Markov chain
Markov decision process
Model Checking
Modest toolset
Probabilistic Model Checking
Probabilistic timed automata
Program verification
SCC
Strongly Connected Components
Topological value iteration
License
  • MIT
</>Source code
Not specified
Packages

Reference papers

Mentions

Contributors

AH

Member of community

4TU