6 citations · 8 across the 2 of their papers we have counts for
2 papers
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.SE2015★ 2 cited
Bandwidth and Wavefront Reduction for Static Variable Ordering in Symbolic Model Checking
Jeroen Meijer, Jaco van de Pol
We demonstrate the applicability of bandwidth and wavefront reduction algorithms to static variable ordering. In symbolic model checking event locality plays a major role in time a…