Third IEEE International Conference on Software Engineering and Formal Methods (SEFM'05) (2005)
Sept. 7, 2005 to Sept. 9, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SEFM.2005.23
Frederic Gervais , Universite de Sherbrooke, Canada
Marc Frappier , Universite de Sherbrooke, Canada
Regine Laleau , LACL, Universite Paris 12, France
EB^3 is a trace-based formal language created for the specification of information systems (IS). Attributes, linked to entities and associations of an IS, are computed in EB^3 by recursive functions on the valid traces of the system. We aim at synthesizing relational database transactions that correspond to EB^3 attribute definitions. Each EB3 action is translated into a transaction. EB^3 attribute definitions are analysed to determine the key values affected by each action. Some key values are retrieved from SELECT statements that correspond to first-order predicates in EB^3 attribute definitions. To avoid problems with the sequencing of SQL statements in the transactions, temporary variables and/or tables are introduced for these key values. Generation of DELETE statements is straightforward, but distinguishing updates from insertions of tuples requires more analysis.
M. Frappier, R. Laleau and F. Gervais, "Generating Relational Database Transactions From Recursive Functions Defined on EB^3 Traces," Third IEEE International Conference on Software Engineering and Formal Methods(SEFM), Koblenz, 2005, pp. 117-126.