Design of an automatic prover dedicated to the refinement of database applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2805, Issue , 2003, Pages 834-854

  Mammar, Amel ^a   Laleau, Régine ^a  

^a CEDRIC   (France)

Author keywords

B method; Data intensive applications; Proof reuse; Refinement process

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

B METHOD; DATA-INTENSIVE APPLICATION; DATABASE APPLICATIONS; PROOF REUSE; REFINEMENT PROCESS;

FORMAL METHODS;

EID: 35248859870     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45236-2_45     Document Type: Article

References (19)

1. Abrial, J.R.: The B-Book, Cambridge University Press, 1996.
2. Clearsy. Atelier B, manuel de référence. available at http://www.atelierb. societe.com.
3. B-Core. B-Toolkit, on-line manual. Oxford, UK, available at http://www.b-core.com.
4. Barras, B., et al., The Coq Proof Assistant, Reference Manual (7.1), INRIA Rocquencourt, 2001.
5. Barthe, G., Pons, O.: Type Isomorphisms and Proof Reuse in Dependent Type Theory, Proceedings of FOSSACS'01, volume 2030, pages 57-71, Springer, 2001.
6. M. Blaha and W. Premerlani. Object-Oriented Modeling and Design for Database Applications. Prentice Hall, 1998.
7. Burdy, L., Meynadier, J-M.: Automatic Refinement, BUG Meeting, FM'99, Toulouse, France, September 1999.
8. S. Ceri. Methodologies and Tools for Database Design. Elsevier Science, 1983.
9. R. Laleau. On the interest of combining UML with the B formal method for the specification of database applications. In ICEIS2000: 2nd International Conference on Enterprise Information Systems, Stafford, UK, July 2000.
10. Laleau, R., Mammar, A.: A Generic Process to Refine a B Specification into a Relational Database Implementation, Int. Conf. ZB2000, Springer-Verlag, LNCS 1878, York, 2000. Extended version in the CEDRIC research report N 86.
11. R. Laleau and A. Mammar. An overview of a method and its support tool for generating B specifications from UML notations. In ASE: 15th IEEE Conference on Automated Software Engineering, Grenoble, France. IEEE Computer Society Press, September 2000.
12. R. Laleau and F. Polack. Specification of integrity-preserving operations in information systems by using a formal UML- based language. Information and Software Technology, 43:693-704, 2001.
13. R. Laleau: Conception et développement formels d'applications bases de données. Habilitation Thesis, CEDRIC Laboratory, Évry, France, 2002. Available at http://cedric.cnam.fr/PUBLIS/RC424.ps.gz
14. Luo, Z.: Coercive Subtyping in Type Theory, In CSL book,276-296, 1996. Also available from "citeseer.nj.nec.com/luo96coercive.html".
15. Magaud, N., Bertot, Y.: Changement de Représentation de Données dans le Calcul des Constructions Inductives. Research report, RR-4039, INRIA, France, October 2000.
16. Magaud, N., Bertot, Y.: Changement de Représentation de Structures de Données dans Coq: le cas des entiers naturels, In Proceedings of JFLA'2001.
17. Mammar, A.: Un environnement formel pour le développement d'applications bases de données. PhD thesis, CEDRIC Laboratory, CNAM, Evry, France, November 2002. Available at http://cedric.cnam.fr/PUBLIS/RC392.ps.gz
18. Pons, O.: Generalization in Type Theory Based Proof Assistants, In Proceedings of TYPES'00. Durham, United Kingdom December 2000.
19. Walther, C., Kolbe, T.: Proving Theorem by Reuse, Artificial Intelligence, 116:17-66, 2000.