Aggregating changes to efficiently check consistency

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationIWPSE'07
Subtitle of host publicationNinth International Workshop on Principles of Software Evolution - In conjunction with the 6th ESEC/FSE Joint Meeting
Pages39-42
Number of pages4
DOIs
StatePublished - Dec 1 2007
EventIWPSE'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 - Dubrovnik, Croatia
Duration: Sep 3 2007Sep 4 2007

Publication series

NameInternational Workshop on Principles of Software Evolution (IWPSE)

Conference

ConferenceIWPSE'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
CountryCroatia
CityDubrovnik
Period9/3/079/4/07

Fingerprint

Finite automata
Large scale systems
Network protocols
Costs

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Modeling and Simulation
  • Computational Theory and Mathematics

Cite this

Subramaniam, M., Chundi, P., & Siy, H. P. (2007). Aggregating changes to efficiently check consistency. In IWPSE'07: Ninth International Workshop on Principles of Software Evolution - In conjunction with the 6th ESEC/FSE Joint Meeting (pp. 39-42). (International Workshop on Principles of Software Evolution (IWPSE)). https://doi.org/10.1145/1294948.1294959

Aggregating changes to efficiently check consistency. / Subramaniam, Mahadevan; Chundi, Parvathi; Siy, Harvey Pe.

IWPSE'07: Ninth International Workshop on Principles of Software Evolution - In conjunction with the 6th ESEC/FSE Joint Meeting. 2007. p. 39-42 (International Workshop on Principles of Software Evolution (IWPSE)).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Subramaniam, M, Chundi, P & Siy, HP 2007, Aggregating changes to efficiently check consistency. in IWPSE'07: Ninth International Workshop on Principles of Software Evolution - In conjunction with the 6th ESEC/FSE Joint Meeting. International Workshop on Principles of Software Evolution (IWPSE), pp. 39-42, 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, Dubrovnik, Croatia, 9/3/07. https://doi.org/10.1145/1294948.1294959
Subramaniam M, Chundi P, Siy HP. Aggregating changes to efficiently check consistency. In IWPSE'07: Ninth International Workshop on Principles of Software Evolution - In conjunction with the 6th ESEC/FSE Joint Meeting. 2007. p. 39-42. (International Workshop on Principles of Software Evolution (IWPSE)). https://doi.org/10.1145/1294948.1294959
Subramaniam, Mahadevan ; Chundi, Parvathi ; Siy, Harvey Pe. / Aggregating changes to efficiently check consistency. IWPSE'07: Ninth International Workshop on Principles of Software Evolution - In conjunction with the 6th ESEC/FSE Joint Meeting. 2007. pp. 39-42 (International Workshop on Principles of Software Evolution (IWPSE)).
@inproceedings{5c52ae12b2f8441ba5c3708e882cbd70,
title = "Aggregating changes to efficiently check consistency",
abstract = "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.",
author = "Mahadevan Subramaniam and Parvathi Chundi and Siy, {Harvey Pe}",
year = "2007",
month = "12",
day = "1",
doi = "10.1145/1294948.1294959",
language = "English (US)",
isbn = "9781595937223",
series = "International Workshop on Principles of Software Evolution (IWPSE)",
pages = "39--42",
booktitle = "IWPSE'07",

}

TY - GEN

T1 - Aggregating changes to efficiently check consistency

AU - Subramaniam, Mahadevan

AU - Chundi, Parvathi

AU - Siy, Harvey Pe

PY - 2007/12/1

Y1 - 2007/12/1

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

SN - 9781595937223

T3 - International Workshop on Principles of Software Evolution (IWPSE)

SP - 39

EP - 42

BT - IWPSE'07

ER -