TY - GEN
T1 - Aggregating changes to efficiently check consistency
AU - Subramaniam, Mahadevan
AU - Chundi, Parvathi
AU - Siy, Harvey
PY - 2007
Y1 - 2007
N2 - Evolving complex systems from one consistent version to another is a challenging problem. Each version usually requires multiple changes in multiple system components having subtle functional dependencies. Mitigating the costs incurred to check the consistency of a new version is an important concern. An efficient approach to guarantee consistency of the new system is proposed. System components are modeled as communicating finite state machines. A change is a set of update rules that add or delete transitions in the system components. Given a set of changes, the proposed approach automatically generates an aggregated update comprised of groups of update rules. The interactions among the update rules are analyzed in terms of their impacts on the states of the system. Groups of update rules are computed such that each group contains one special rule whose impacted states subsume that of the others in the group. If that rule preserves consistency then the entire group preserves consistency. The proposed approach has been applied to consistently evolve a family of cache coherence protocols with highly encouraging results.
AB - Evolving complex systems from one consistent version to another is a challenging problem. Each version usually requires multiple changes in multiple system components having subtle functional dependencies. Mitigating the costs incurred to check the consistency of a new version is an important concern. An efficient approach to guarantee consistency of the new system is proposed. System components are modeled as communicating finite state machines. A change is a set of update rules that add or delete transitions in the system components. Given a set of changes, the proposed approach automatically generates an aggregated update comprised of groups of update rules. The interactions among the update rules are analyzed in terms of their impacts on the states of the system. Groups of update rules are computed such that each group contains one special rule whose impacted states subsume that of the others in the group. If that rule preserves consistency then the entire group preserves consistency. The proposed approach has been applied to consistently evolve a family of cache coherence protocols with highly encouraging results.
UR - http://www.scopus.com/inward/record.url?scp=41149101232&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=41149101232&partnerID=8YFLogxK
U2 - 10.1145/1294948.1294959
DO - 10.1145/1294948.1294959
M3 - Conference contribution
AN - SCOPUS:41149101232
SN - 9781595937223
T3 - International Workshop on Principles of Software Evolution (IWPSE)
SP - 39
EP - 42
BT - IWPSE'07
T2 - IWPSE'07: Ninth International Workshop on Principles of Software Evolution - In conjunction with the 6th ESEC(European Software Engineering Conference)/FSE(Foundations of Software Engineering) Joint Meeting
Y2 - 3 September 2007 through 4 September 2007
ER -