FORMAL VERIFICATION OF AN ACCESS CONCURRENCY CONTROL ALGORITHM FOR TRANSACTION TIME RELATIONS

Achraf Makni, Rafik Bouaziz, Faïez Gargouri

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.

References

  1. Bernstein, P, A., Hadzilacos, V., Goodman, N., 1987. Concurrency control and recovery in DBS. ADDISON-WESLEY Edition.
  2. Berstel, J., Reghizzi, S, C., Roussel, G., Pietro, P, S., 2005. A Scalable Formal Method for Design and Automatic Checking of User Interfaces. ACM Transactions on Software Engineering and Methodology.
  3. Brinksma, E., Mader, A., Fehnker, A., 2002. Verification and Optimization of a PLC Control Schedule. Journal on Software Tools for Technology Transfer.
  4. Bouaziz, R., Makni, A., 2005. ACCO_CF/RTT: Un algorithme de contrôle de concurrence optimiste pour les relations temporelles de transaction. Information Sciences for Decision Makin, Janvier 2005.
  5. Castro, C., 1998. On concurrency management in temporal relational databases. In SEBD'98.
  6. Elloumi, S, D., Bouaziz, R., Moalla, M., 1998. Contrôle de concurrence multiversion dans les bases de données temporelles. In BDA'98. International Conference on advanced databases.
  7. Finger, M., McBrien, P., 1997. Concurrency Control for Perceivedly Instantaneous Transactions in Valid-Time Databases. In TIME'97.
  8. Gardarin, G., 1988. Base de données : Les systèmes et leurs langages. EYROLLES Edition.
  9. Gnesi, S., Lenzini, G., Latella, D., Abbaneo, C., Amendola, A., Marmo, P., 2000. An Automatic SPIN Validation of a Safety Critical Railway Control System. In DSN'00. International Conference on Dependable Systems and Networks. Published by IEEE Computer Society Press.
  10. Havelund, K., Lowry, M., Penix, J., 2001. Formal Analysis of a Space Craft Controller using SPIN. IEEE Transaction on Software Engineering.
  11. Holzmann, G, J., 1997. The model cheker spin. IEEE Transaction on Software Engineering.
  12. Rahgozar, M., 1987. Contrôle de concurrence par gestion des événements. PhD thesis.
Download


Paper Citation


in Harvard Style

Makni A., Bouaziz R. and Gargouri F. (2006). FORMAL VERIFICATION OF AN ACCESS CONCURRENCY CONTROL ALGORITHM FOR TRANSACTION TIME RELATIONS . In Proceedings of the Eighth International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-972-8865-41-2, pages 269-272. DOI: 10.5220/0002487602690272


in Bibtex Style

@conference{iceis06,
author={Achraf Makni and Rafik Bouaziz and Faïez Gargouri},
title={FORMAL VERIFICATION OF AN ACCESS CONCURRENCY CONTROL ALGORITHM FOR TRANSACTION TIME RELATIONS},
booktitle={Proceedings of the Eighth International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2006},
pages={269-272},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002487602690272},
isbn={978-972-8865-41-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Eighth International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - FORMAL VERIFICATION OF AN ACCESS CONCURRENCY CONTROL ALGORITHM FOR TRANSACTION TIME RELATIONS
SN - 978-972-8865-41-2
AU - Makni A.
AU - Bouaziz R.
AU - Gargouri F.
PY - 2006
SP - 269
EP - 272
DO - 10.5220/0002487602690272