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

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