loading...
Formal Verification of an Optimistic Concurrency Control Algorithm using SPIN
Budapest, Hungary June 15-June 17
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TIME.2006.15Thirteenth International Symposium on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Achraf Makni, Economiques et de Gestion de Sfax, Tunisia
Rafik Bouaziz, Economiques et de Gestion de Sfax, Tunisia
Faiez Gargouri, Multim?dia de Sfax, Tunisia
To contribute to the promotion of concurrency controllers for temporal databases, we propose in this paper to formally check the access concurrency control algorithm proposed in [4], using SPIN. This algorithm is based on the optimistic approach and must guarantee strong consistency for transaction time relations. SPIN provides a software model checking with a powerful tool to detect errors. It is an appropriate tool for analyzing the logical consistency of concurrent systems. The main target consists of retrieving and correcting blocking error type, on the one hand, and ensuring the validity of the considered system properties specified by temporal logic formulae, on the other hand.
Citation:
Achraf Makni, Rafik Bouaziz, Faiez Gargouri, "Formal Verification of an Optimistic Concurrency Control Algorithm using SPIN," time, pp.160-167, Thirteenth International Symposium on Temporal Representation and Reasoning (TIME'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.