An Automatically Verified Prototype of the Tokeneer ID Station Specification

Cristiá, Maximiliano; Rossi, Gianfranco

doi:10.1007/s10817-021-09602-2

Cited by 13 publications

(13 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, Mammar and Leleau had to work out 80 proof obligations interactively in spite of Roding using external provers such as Atelier B and SMT solvers. The figures obtained with {log} for the LGS are aligned with previous results concerning the verification of a {log} prototype of the Tokeneer ID Station written from a Z specification [20] and the verification of the Bell-LaPadula security model [19].…”

Section: Encoding Proof Obligations In {Log}supporting

confidence: 81%

“…All these procedures are integrated into a single solver, implemented in Prolog, which constitutes the core part of the {log} tool. Several in-depth empirical evaluations provide evidence that {log} is able to solve non-trivial problems [13][14][15]18]; in particular as an automated verifier of security properties [19,20].…”

Section: Overview Of {Log}mentioning

confidence: 99%

“…As a programming language, {log} can be used to implement set-based specifications (e.g., B or Z specifications). As a matter of fact, an industrial-strength Z specification has been translated into {log} [20] and students of a course on Z taught both at Rosario (Argentina) and Parma (Italy) use {log} as the prototyping language for their Z specifications [25]. This means that {log} can serve as a programming language in which a prototype of a set-based specification can be easily implemented.…”

Section: {Log} As a Programming Languagementioning

confidence: 99%

See 2 more Smart Citations

An Automatically Verified Prototype of a Landing Gear System

Cristiá¹,

Rossi²

2021

Preprint

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Encoding Proof Obligations In {Log}supporting

confidence: 81%

Section: Overview Of {Log}mentioning

confidence: 99%

Section: {Log} As a Programming Languagementioning

confidence: 99%

See 1 more Smart Citation

An Automatically Verified Prototype of a Landing Gear System

Cristiá¹,

Rossi²

2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…All these procedures are integrated into a single solver, implemented in Prolog, which constitutes the core part of the {log} tool. Several in-depth empirical evaluations provide evidence that {log} is able to solve non-trivial problems [CR20b,CR18,CR17,CRF13]; in particular as an automated verifier of security properties [CR21a,CR20a].…”

Section: {Log}mentioning

confidence: 99%

$\{log\}$: Set Formulas as Programs

Cristiá,

Rossi

2021

Preprint

Self Cite

View full text Add to dashboard Cite

{log} is a programming language at the intersection of Constraint Logic Programming, set programming and declarative programming. But {log} is also a satisfiability solver for a theory of finite sets and finite binary relations. With {log} programmers can write abstract programs using all the power of set theory and binary relations. These programs are not very efficient but they are very close to specifications. Then, their correctness is more evident. Furthermore, {log} programs are also set formulas. Hence, programmers can use {log} again to automatically prove their programs verify non trivial properties. In this paper we show this development methodology by means of several examples.

show abstract

“…The limitation of L BR to finite sets is not so severe as many programs operate only on finite data structures. Therefore, L BR can be used as a specification language for a large class of software systems and {log} as a tool to reason about them [31,34,35,30,32].…”

Section: The {Log} Languagementioning

confidence: 99%

Proof Automation in the Theory of Finite Sets and Finite Set Relation Algebra

Cristiá¹,

Katz²,

Rossi³

2021

Preprint

Self Cite

View full text Add to dashboard Cite

setlog') is a satisfiability solver for formulas of the theory of finite sets and finite set relation algebra (FS&RA). As such, it can be used as an automated theorem prover (ATP) for this theory. {log} is able to automatically prove a number of FS&RA theorems, but not all of them. Nevertheless, we have observed that many theorems that {log} cannot automatically prove can be divided into a few subgoals automatically dischargeable by {log}. The purpose of this work is to present a prototype interactive theorem prover (ITP), called {log}-ITP, providing evidence that a proper integration of {log} into world-class ITP's can deliver a great deal of proof automation concerning FS&RA. An empirical evaluation based on 210 theorems from the TPTP and Coq's SSReflect libraries shows a noticeable reduction in the size and complexity of the proofs with respect to Coq.

show abstract

An Automatically Verified Prototype of the Tokeneer ID Station Specification

Cited by 13 publications

References 31 publications

An Automatically Verified Prototype of a Landing Gear System

An Automatically Verified Prototype of a Landing Gear System

$\{log\}$: Set Formulas as Programs

Proof Automation in the Theory of Finite Sets and Finite Set Relation Algebra

Contact Info

Product

Resources

About