Automating Invariant Verification of Behavioral Specifications

Authors:
Masahiro Nakano;Kazuhiro Ogata;Masaki Nakamura;Kokichi Futatsugi
Affiliations:
Japan Advanced Institute of Science and Technology (JAIST), Japan;Japan Advanced Institute of Science and Technology (JAIST), Japan;Japan Advanced Institute of Science and Technology (JAIST), Japan;Japan Advanced Institute of Science and Technology (JAIST), Japan
Venue:
QSIC '06 Proceedings of the Sixth International Conference on Quality Software
Year:
2006

Citing 0
Cited 2

Modeling and verification of real-time systems based on equations

Science of Computer Programming
Induction-guided falsification

ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a method of automating invariant verification of behavioral specifications, which are algebraic specifications of abstract machines. The proposed method is based on fixed-point computation, which is one of the standard techniques for automatic (invariant) verification. One notable feature of the proposed method is to find and use as lemmas state predicates whose invariant proofs may (even mutually) depend on other state predicates whose invariant proofs may not be completed. Cr`eme is a tool based on the proposed method. We also report on a case study in which Cr`eme proves fully automatically that the NSLPK authentication protocol satisfies the secrecy property.