30 citations · 36 across the 2 of their papers we have counts for
Showing cs.SEShow all
2 papers · 1 filter
cs.SE2017★ 6 cited
Interfacing Automatic Proof Agents in Atelier B: Introducing "iapa"
Lilian Burdy, David Déharbe, Étienne Prun
The application of automatic theorem provers to discharge proof obligations is necessary to apply formal methods in an efficient manner. Tools supporting formal methods, such as At…
cs.SE2012★ 30 cited
Formally Checking Large Data Sets in the Railways
Thierry Lecomte, Lilian Burdy, Michael Leuschel
This article presents industrial experience of validating large data sets against specification written using the B / Event-B mathematical language and the ProB model checker.