A perfecto verification: Combining model checking with deductive analysis to verify real-life software

Yonit Kesten; Amit Klein; Amir Pnueli; Gil Raanan

doi:10.1007/3-540-48119-2_12

A perfecto verification: Combining model checking with deductive analysis to verify real-life software

Yonit Kesten, Amit Klein, Amir Pnueli, Gil Raanan

Department of Management

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Scopus citations

Abstract

The paper presents an approach to the formal verification of a complete software system intended to support the flagship product of Perfecto Technologies which enforces application security over an open communication net. Based on initial experimentation, it was decided that the verification method will be based on a combination of model-checking using spin with deductive verification which handles the more data-intensive elements of the design. The analysis was that only such a combination can cover by formal verification all the important aspects of the complete system. In order to enable model checking of large portions of the design, we have developed an assume-guarantee approach which supports compositional verification. We describe how this general approach was implemented in the spin framework. Then, we explain the need to split the verification activity into the model-checking part which deals with the control issues such as concurrency or deadlocking and a deductive part which handles the data-intensive elements of the design.

Original language	English
Title of host publication	FM 1999 – Formal Methods - World Congress on Formal Methods in the Development of Computing Systems, Proceedings
Editors	Jeannette M. Wing, Jim Woodcock, Jim Davies
Publisher	Springer Verlag
Pages	173-194
Number of pages	22
ISBN (Print)	3540665870, 9783540665878
DOIs	https://doi.org/10.1007/3-540-48119-2_12
State	Published - 1 Jan 1999
Event	1st World Congress on Formal Methods in the Development of Computing Systems, FM 1999 - Toulouse, France Duration: 20 Sep 1999 → 24 Sep 1999

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1708
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	1st World Congress on Formal Methods in the Development of Computing Systems, FM 1999
Country/Territory	France
City	Toulouse
Period	20/09/99 → 24/09/99

Keywords

Concurrent systems
Model checkers (spin promela)
Models
Network protocols
Object oriented
Safety properties
Security
Telecommunications
Verification (deductive methods assume-guarantee compositional)

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-48119-2_12

Cite this

Kesten, Y., Klein, A., Pnueli, A., & Raanan, G. (1999). A perfecto verification: Combining model checking with deductive analysis to verify real-life software. In J. M. Wing, J. Woodcock, & J. Davies (Eds.), FM 1999 – Formal Methods - World Congress on Formal Methods in the Development of Computing Systems, Proceedings (pp. 173-194). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1708). Springer Verlag. https://doi.org/10.1007/3-540-48119-2_12

Kesten, Yonit ; Klein, Amit ; Pnueli, Amir et al. / A perfecto verification : Combining model checking with deductive analysis to verify real-life software. FM 1999 – Formal Methods - World Congress on Formal Methods in the Development of Computing Systems, Proceedings. editor / Jeannette M. Wing ; Jim Woodcock ; Jim Davies. Springer Verlag, 1999. pp. 173-194 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{85659d89884043d79bb6097df230056b,

title = "A perfecto verification: Combining model checking with deductive analysis to verify real-life software",

abstract = "The paper presents an approach to the formal verification of a complete software system intended to support the flagship product of Perfecto Technologies which enforces application security over an open communication net. Based on initial experimentation, it was decided that the verification method will be based on a combination of model-checking using spin with deductive verification which handles the more data-intensive elements of the design. The analysis was that only such a combination can cover by formal verification all the important aspects of the complete system. In order to enable model checking of large portions of the design, we have developed an assume-guarantee approach which supports compositional verification. We describe how this general approach was implemented in the spin framework. Then, we explain the need to split the verification activity into the model-checking part which deals with the control issues such as concurrency or deadlocking and a deductive part which handles the data-intensive elements of the design.",

keywords = "Concurrent systems, Model checkers (spin promela), Models, Network protocols, Object oriented, Safety properties, Security, Telecommunications, Verification (deductive methods assume-guarantee compositional)",

author = "Yonit Kesten and Amit Klein and Amir Pnueli and Gil Raanan",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 1st World Congress on Formal Methods in the Development of Computing Systems, FM 1999 ; Conference date: 20-09-1999 Through 24-09-1999",

year = "1999",

month = jan,

day = "1",

doi = "10.1007/3-540-48119-2_12",

language = "English",

isbn = "3540665870",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "173--194",

editor = "{ Wing}, {Jeannette M.} and Jim Woodcock and Jim Davies",

booktitle = "FM 1999 – Formal Methods - World Congress on Formal Methods in the Development of Computing Systems, Proceedings",

address = "Germany",

}

Kesten, Y, Klein, A, Pnueli, A & Raanan, G 1999, A perfecto verification: Combining model checking with deductive analysis to verify real-life software. in JM Wing, J Woodcock & J Davies (eds), FM 1999 – Formal Methods - World Congress on Formal Methods in the Development of Computing Systems, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1708, Springer Verlag, pp. 173-194, 1st World Congress on Formal Methods in the Development of Computing Systems, FM 1999, Toulouse, France, 20/09/99. https://doi.org/10.1007/3-540-48119-2_12

A perfecto verification: Combining model checking with deductive analysis to verify real-life software. / Kesten, Yonit; Klein, Amit; Pnueli, Amir et al.
FM 1999 – Formal Methods - World Congress on Formal Methods in the Development of Computing Systems, Proceedings. ed. / Jeannette M. Wing; Jim Woodcock; Jim Davies. Springer Verlag, 1999. p. 173-194 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1708).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A perfecto verification

T2 - 1st World Congress on Formal Methods in the Development of Computing Systems, FM 1999

AU - Kesten, Yonit

AU - Klein, Amit

AU - Pnueli, Amir

AU - Raanan, Gil

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1999.

PY - 1999/1/1

Y1 - 1999/1/1

N2 - The paper presents an approach to the formal verification of a complete software system intended to support the flagship product of Perfecto Technologies which enforces application security over an open communication net. Based on initial experimentation, it was decided that the verification method will be based on a combination of model-checking using spin with deductive verification which handles the more data-intensive elements of the design. The analysis was that only such a combination can cover by formal verification all the important aspects of the complete system. In order to enable model checking of large portions of the design, we have developed an assume-guarantee approach which supports compositional verification. We describe how this general approach was implemented in the spin framework. Then, we explain the need to split the verification activity into the model-checking part which deals with the control issues such as concurrency or deadlocking and a deductive part which handles the data-intensive elements of the design.

AB - The paper presents an approach to the formal verification of a complete software system intended to support the flagship product of Perfecto Technologies which enforces application security over an open communication net. Based on initial experimentation, it was decided that the verification method will be based on a combination of model-checking using spin with deductive verification which handles the more data-intensive elements of the design. The analysis was that only such a combination can cover by formal verification all the important aspects of the complete system. In order to enable model checking of large portions of the design, we have developed an assume-guarantee approach which supports compositional verification. We describe how this general approach was implemented in the spin framework. Then, we explain the need to split the verification activity into the model-checking part which deals with the control issues such as concurrency or deadlocking and a deductive part which handles the data-intensive elements of the design.

KW - Concurrent systems

KW - Model checkers (spin promela)

KW - Models

KW - Network protocols

KW - Object oriented

KW - Safety properties

KW - Security

KW - Telecommunications

KW - Verification (deductive methods assume-guarantee compositional)

UR - http://www.scopus.com/inward/record.url?scp=84865779749&partnerID=8YFLogxK

U2 - 10.1007/3-540-48119-2_12

DO - 10.1007/3-540-48119-2_12

M3 - Conference contribution

AN - SCOPUS:84865779749

SN - 3540665870

SN - 9783540665878

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 173

EP - 194

BT - FM 1999 – Formal Methods - World Congress on Formal Methods in the Development of Computing Systems, Proceedings

A2 - Wing, Jeannette M.

A2 - Woodcock, Jim

A2 - Davies, Jim

PB - Springer Verlag

Y2 - 20 September 1999 through 24 September 1999

ER -

Kesten Y, Klein A, Pnueli A, Raanan G. A perfecto verification: Combining model checking with deductive analysis to verify real-life software. In Wing JM, Woodcock J, Davies J, editors, FM 1999 – Formal Methods - World Congress on Formal Methods in the Development of Computing Systems, Proceedings. Springer Verlag. 1999. p. 173-194. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-48119-2_12

A perfecto verification: Combining model checking with deductive analysis to verify real-life software

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this