A generic process to refine a B specification into a relational database implementation

Régine Laleau; Amel Mammar

doi:10.1007/3-540-44525-0_3

A generic process to refine a B specification into a relational database implementation

Régine Laleau, Amel Mammar

CEDRIC-IIE(CNAM)

Research output: Contribution to journal › Article › peer-review

Abstract

In this paper, an approach for refining B abstract specifications describing data-intensive applications into relational database implementations is presented. Using the refinement process of the B method, a set of generic refinement rules are described that take into account both data and operations. The last step consists of mapping the final refined component into a relational database implementation. The different rules have been checked with the AtelierB prover. The aim of the work is to automate the refinement steps. This is possible thanks to the generi-city feature of the rules. The approach is illustrated through a running example.

Original language	English
Pages (from-to)	22-41
Number of pages	20
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1878
DOIs	https://doi.org/10.1007/3-540-44525-0_3
Publication status	Published - 1 Jan 2000
Externally published	Yes

Keywords

B method
Refinement process
Relational database implementation

Access to Document

10.1007/3-540-44525-0_3

Cite this

@article{206064bc05174028902790c34324d65f,

title = "A generic process to refine a B specification into a relational database implementation",

abstract = "In this paper, an approach for refining B abstract specifications describing data-intensive applications into relational database implementations is presented. Using the refinement process of the B method, a set of generic refinement rules are described that take into account both data and operations. The last step consists of mapping the final refined component into a relational database implementation. The different rules have been checked with the AtelierB prover. The aim of the work is to automate the refinement steps. This is possible thanks to the generi-city feature of the rules. The approach is illustrated through a running example.",

keywords = "B method, Refinement process, Relational database implementation",

author = "R{\'e}gine Laleau and Amel Mammar",

year = "2000",

month = jan,

day = "1",

doi = "10.1007/3-540-44525-0\_3",

language = "English",

volume = "1878",

pages = "22--41",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

}

TY - JOUR

T1 - A generic process to refine a B specification into a relational database implementation

AU - Laleau, Régine

AU - Mammar, Amel

PY - 2000/1/1

Y1 - 2000/1/1

N2 - In this paper, an approach for refining B abstract specifications describing data-intensive applications into relational database implementations is presented. Using the refinement process of the B method, a set of generic refinement rules are described that take into account both data and operations. The last step consists of mapping the final refined component into a relational database implementation. The different rules have been checked with the AtelierB prover. The aim of the work is to automate the refinement steps. This is possible thanks to the generi-city feature of the rules. The approach is illustrated through a running example.

AB - In this paper, an approach for refining B abstract specifications describing data-intensive applications into relational database implementations is presented. Using the refinement process of the B method, a set of generic refinement rules are described that take into account both data and operations. The last step consists of mapping the final refined component into a relational database implementation. The different rules have been checked with the AtelierB prover. The aim of the work is to automate the refinement steps. This is possible thanks to the generi-city feature of the rules. The approach is illustrated through a running example.

KW - B method

KW - Refinement process

KW - Relational database implementation

U2 - 10.1007/3-540-44525-0_3

DO - 10.1007/3-540-44525-0_3

M3 - Article

AN - SCOPUS:84937394170

SN - 0302-9743

VL - 1878

SP - 22

EP - 41

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

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

ER -

A generic process to refine a B specification into a relational database implementation

Abstract

Keywords

Access to Document

Fingerprint

Cite this