Using Answer Set Programming in the Development of Verified Software

Schanda, Florian; Brain, Martin

doi:10.4230/lipics.iclp.2012.72

Cited by 3 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Answer Set Programming, which is close to constraint programming, has been used to generate counterexamples for false and unprovable verification conditions (VC) of the Tokeneer project [35]. These VC correspond to those generated during the verification of the SPARK implementation.…”

Section: Other Work About the Tokeneer Projectmentioning

confidence: 99%

An Automatically Verified Prototype of the Tokeneer ID Station Specification

Cristiá¹,

Rossi²

2020

Preprint

View full text Add to dashboard Cite

The Tokeneer project was an initiative set forth by the National Security Agency (NSA, USA) to be used as a demonstration that developing highly secure systems can be made by applying rigorous methods in a cost effective manner. Altran Praxis (UK) was selected by NSA to carry out the development of the Tokeneer ID Station. The company wrote a Z specification later implemented in the SPARK Ada programming language, which was verified using the SPARK Examiner toolset. In this paper, we show that the Z specification can be easily and naturally encoded in the {log} set constraint language, thus generating a functional prototype. Furthermore, we show that {log}'s automated proving capabilities can discharge all the proof obligations concerning state invariants as well as important security properties. As a consequence, the prototype can be regarded as correct with respect to the verified properties. This provides empirical evidence that Z users can use {log} to generate correct prototypes from their Z specifications. In turn, these prototypes enable or simplify some verification activities discussed in the paper.

show abstract

Section: Other Work About the Tokeneer Projectmentioning

confidence: 99%