Specifying and Verifying Cases Retrieval System Combining Event B and Spin

This paper presents a complete study for the specification and mechanical verification of cases retrieval systems (CRS) within the generic framework that supports the many-to-many connection of formal development environments and model checkers. We aim at combining on an example, refinement techniques, verification by theorem proving and model checking in an entire development, to guarantee software correctness properties. We first build a underlying abstract system using a roles-based collaboration model, then describe a practical approach for increasingly developing flexible and reliable formal specifications of CRS using event B, exemplified on contract net protocol (CNP) as interaction contract. A proper translator is introduced as the bridge between formal specifications and model checkers. This entire development is mechanically proved with respect to safety properties using B tool and, complementally, with respect to liveness properties using the SPIN tool.

[1]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[2]  Peter Gorm Larsen,et al.  The IFAD VDM-SL toolbox: a practical approach to formal specifications , 1994, SIGP.

[3]  Douglas R. Smith,et al.  KIDS: A Semiautomatic Program Development System , 1990, IEEE Trans. Software Eng..

[4]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.

[5]  Ralph-Johan Back,et al.  Decentralization of Process Nets with Centralized Control , 1983, PODC.

[6]  Zheng Qin,et al.  Formal Spsecification and Proof of Multi-Agent Applications Using Event B , 2007 .

[7]  Jean-Raymond Abrial,et al.  The B-book - assigning programs to meanings , 1996 .

[8]  Renata Vieira,et al.  An Empirically-based System for Processing Definite Descriptions , 2000, CL.

[9]  Klaus Havelund,et al.  Model Checking Programs , 2004, Automated Software Engineering.

[10]  Jacques Ferber,et al.  Multi-agent systems - an introduction to distributed artificial intelligence , 1999 .

[11]  J. C. Attiogbe A mechanically proved development combining B abstract systems and Spin , 2004 .

[12]  Ron Artstein,et al.  The Reliability of Anaphoric Annotation, Reconsidered: Taking Ambiguity into Account , 2005, FCA@ACL.

[13]  Hwee Tou Ng,et al.  A Machine Learning Approach to Coreference Resolution of Noun Phrases , 2001, CL.

[14]  Gerard J. Holzmann,et al.  The SPIN Model Checker , 2003 .

[15]  Lynette Hirschman,et al.  A Model-Theoretic Coreference Scoring Scheme , 1995, MUC.

[16]  Mitchell P. Marcus,et al.  OntoNotes: The 90% Solution , 2006, NAACL.

[17]  Sanda M. Harabagiu,et al.  RESOLUTION , 1977, Monatsschrift für Kriminologie und Strafrechtsreform.