11 citations · 25 across the 10 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
Managing LTL properties in Event-B refinement
Steve Schneider, Helen Treharne, Heike Wehrheim +1
Refinement in Event-B supports the development of systems via proof based step-wise refinement of events. This refinement approach ensures safety properties are preserved, but addi…