Abstract
In this paper we show how (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 an Event-B specification, developed by Mammar and Laleau, of the case study known as the Landing Gear System (LGS). Next we use to discharge all the proof obligations proposed in the Event-B specification by the Rodin platform. In this way, the 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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.