TY - CHAP
T1 - Intentions of operations - Characterization and preservation
AU - Balaban, Mira
AU - Jurk, Steffen
PY - 2003/1/1
Y1 - 2003/1/1
N2 - Frequent changes of software requirements imply changes of the underlying database, like database schema, integrity constraints, as well as database transactions and programs. Tools like ERWin, DBMain and Silverrun help developers in applying these changes. Yet, the automatic derivation might pose a problem: Since the developer is not aware of the details of the derivation applications, the resulting programs might include contradictory actions. That is, intentions of programs might be reversed by the automatic derivation, resulting a different behavior than expected by the developer. In this paper, a compile-time algorithm that achieves preservation of intentions is suggested. The algorithm revises a composite program into a program without contradictory actions. It is based on a fine analysis of effects, that is sensitive to computation paths. The output program is expressive and efficient since it interleaves run-time sensitive analysis of already reduced effects within the input program. The compile-time reduction of effects accounts for the efficiency; the run-time sensitivity of effects accounts for the expressiveness. The novelty of the proposed approach is in combining static and dynamic analysis in a way that run-time overhead is minimized without sacrificing the expressivity of the resulting program.
AB - Frequent changes of software requirements imply changes of the underlying database, like database schema, integrity constraints, as well as database transactions and programs. Tools like ERWin, DBMain and Silverrun help developers in applying these changes. Yet, the automatic derivation might pose a problem: Since the developer is not aware of the details of the derivation applications, the resulting programs might include contradictory actions. That is, intentions of programs might be reversed by the automatic derivation, resulting a different behavior than expected by the developer. In this paper, a compile-time algorithm that achieves preservation of intentions is suggested. The algorithm revises a composite program into a program without contradictory actions. It is based on a fine analysis of effects, that is sensitive to computation paths. The output program is expressive and efficient since it interleaves run-time sensitive analysis of already reduced effects within the input program. The compile-time reduction of effects accounts for the efficiency; the run-time sensitivity of effects accounts for the expressiveness. The novelty of the proposed approach is in combining static and dynamic analysis in a way that run-time overhead is minimized without sacrificing the expressivity of the resulting program.
UR - http://www.scopus.com/inward/record.url?scp=0242276251&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-45275-1_9
DO - 10.1007/978-3-540-45275-1_9
M3 - Chapter
AN - SCOPUS:0242276251
SN - 3540202552
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 100
EP - 111
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
A2 - Genero, Marcela
A2 - Grandi, Fabio
A2 - van den Heuvel, Willem-Jan
A2 - Krogstie, John
A2 - Lyytinen, Kalle
A2 - Mayr , Heinrich C.
A2 - Nelson, Jim
A2 - Olivé, Antoni
A2 - Piattini, Mario
A2 - Poels, Geert
A2 - Roddick, John
A2 - Siau, Keng
A2 - Yoshikawa, Masatoshi
A2 - Yu, Eric S. K.
PB - Springer Verlag
ER -