By Topic

Generating Relational Database Transactions From Recursive Functions Defined on EB^3 Traces

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Gervais, F. ; Dept. de d''Inf., Sherbrooke Univ., Que. ; Frappier, M. ; Laleau, R.

EB3 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 EB3 by recursive functions on the valid traces of the system. We aim at synthesizing relational database transactions that correspond to EB3 attribute definitions. Each EB3 action is translated into a transaction. EB3 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 EB3 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

Published in:

Software Engineering and Formal Methods, 2005. SEFM 2005. Third IEEE International Conference on

Date of Conference:

7-9 Sept. 2005