An Automatically Verified Prototype of the Tokeneer ID Station Specification

被引:7
作者
Cristia, Maximiliano [1 ,2 ]
Rossi, Gianfranco [3 ]
机构
[1] Univ Nacl Rosario, Rosario, Argentina
[2] CIFASIS, Rosario, Argentina
[3] Univ Parma, Parma, Italy
关键词
Tokeneer ID Station specification; Z notation; {log}; Constraint programming; Prototyping; Automated verification; Automated proof; FORMAL VERIFICATION;
D O I
10.1007/s10817-021-09602-2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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 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 readily and naturally encoded in the {log} set constraint language, thereby 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.
引用
收藏
页码:1125 / 1151
页数:27
相关论文
共 50 条
[11]   Automated Reasoning with Restricted Intensional Sets [J].
Cristia, Maximiliano ;
Rossi, Gianfranco .
JOURNAL OF AUTOMATED REASONING, 2021, 65 (06) :809-890
[12]   Automated Proof of Bell-LaPadula Security Properties [J].
Cristia, Maximiliano ;
Rossi, Gianfranco .
JOURNAL OF AUTOMATED REASONING, 2021, 65 (04) :463-478
[13]   Solving Quantifier-Free First-Order Constraints Over Finite Sets and Binary Relations [J].
Cristia, Maximiliano ;
Rossi, Gianfranco .
JOURNAL OF AUTOMATED REASONING, 2020, 64 (02) :295-330
[14]   A Set Solver for Finite Set Relation Algebra [J].
Cristia, Maximiliano ;
Rossi, Gianfranco .
RELATIONAL AND ALGEBRAIC METHODS IN COMPUTER SCIENCE, 2018, 11194 :333-349
[15]   A Decision Procedure for Restricted Intensional Sets [J].
Cristia, Maximiliano ;
Rossi, Gianfranco .
AUTOMATED DEDUCTION - CADE 26, 2017, 10395 :185-201
[16]   Tool support for the Test Template Framework [J].
Cristia, Maximiliano ;
Albertengo, Pablo ;
Frydman, Claudia ;
Pluess, Brian ;
Rodriguez Monetti, Pablo .
SOFTWARE TESTING VERIFICATION & RELIABILITY, 2014, 24 (01) :3-37
[17]  
Cristiá M, 2013, LECT NOTES COMPUT SC, V8137, P229, DOI 10.1007/978-3-642-40561-7_16
[18]   Sets and constraint logic programming [J].
Dovier, A ;
Piazza, C ;
Pontelli, E ;
Rossi, G .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 2000, 22 (05) :861-931
[19]   Set unification [J].
Dovier, Agostino ;
Pontelli, Enrico ;
Rossi, Gianfranco .
THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2006, 6 (06) :645-701
[20]  
Dubois, 2018, P SETS ABZ 2018 SOUT, V2199, P17