7 citations · 17 across the 3 of their papers we have counts for
Showing cs.SEShow all
2 papers · 1 filter
cs.SE2016★ 6 cited
Symbolic Reachability Analysis of B through ProB and LTSmin
Jens Bendisposto, Philipp Koerner, Michael Leuschel +4
We present a symbolic reachability analysis approach for B that can provide a significant speedup over traditional explicit state model checking. The symbolic analysis is implement…
cs.SE2014★ 7 cited
Who watches the watchers: Validating the ProB Validation Tool
Jens Bendisposto, Sebastian Krings, Michael Leuschel
Over the years, ProB has moved from a tool that complemented proving, to a development environment that is now sometimes used instead of proving for applications, such as exhaustiv…