Authors:
Achraf Makni
;
Rafik Bouaziz
and
Faïez Gargouri
Affiliation:
Faculty of Economic Sciences and Management of Sfax, Tunisia
Keyword(s):
Optimistic concurrency control, Strong consistency, Transaction time relation, Formal verification, PROMELA/SPIN.
Related
Ontology
Subjects/Areas/Topics:
Data and Application Security and Privacy
;
Database Security
;
Databases and Information Systems Integration
;
Deductive, Active, Temporal and Real-Time Databases
;
Enterprise Information Systems
;
Information and Systems Security
;
Information Systems Analysis and Specification
;
Software Engineering
Abstract:
We propose in this paper to formally check the access concurrency control algorithm proposed in (Bouaziz, 2005). This algorithm is based on the optimistic approach and guarantees strong consistency for the transaction time relations. The specification of our model under PROMELA language allowed us to ensure the feasibility of the validation. We then could, using the SPIN model checkers, avoid errors of blocking type and check safety properties specified by temporal logic formulas.