An Automatically Verified Prototype of a Landing Gear System

Abstract

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.