An Automatically Verified Prototype of a Landing Gear System
This work provides empirical evidence for using CLP and set theory in program verification, but it is incremental as it applies an existing method to a specific case study.
The paper tackled the problem of verifying a landing gear system specification by using the constraint logic programming language {log} to encode and automatically discharge all proof obligations from an Event-B model, resulting in an automatically verified prototype.
In this paper we show how $\{log\}$ (read `setlog'), a Constraint Logic Programming (CLP) language based on set theory, can be used as an automated verifier for B specifications. In particular we encode in $\{log\}$ an Event-B specification, developed by Mammar and Laleau, of the case study known as the Landing Gear System (LGS). Next we use $\{log\}$ to discharge all the proof obligations proposed in the Event-B specification by the Rodin platform. In this way, the $\{log\}$ program can be regarded as an automatically verified prototype of the LGS. We believe this case study provides empirical evidence on how CLP and set theory can be used in tandem as a vehicle for program verification.