Section: New Results
Highlights of the Year
In the framework of the BWare project, Pierre Halmagrand, David Delahaye, Damien Doligez, and Olivier Hermant designed a new version of the B set theory using deduction modulo, in order to automatically verify a large part of the proof obligations of the benchmark of BWare, which consists of proof obligations coming from the modeling of industrial applications (about 13,000 proof obligations). Using this B set theory modulo with Zenon Modulo, as well as some other extensions of Zenon, such as typed proof search and arithmetic (implemented by Guillaume Bury), we are able to automatically verify more than 95% of the proof obligations of BWare, while the regular version of Zenon is only able to prove less than 1% of these proof obligations. This is a real breakthrough for the BWare project, but also for automated deduction in general, as it tends to show that deduction modulo is the way to go when reasoning modulo theories.