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 publication9th International Workshop on Principles of Software Evolution, IWPSE 2007, Held in Conjunction with the 6th ESEC/FSE Joint Meeting
Pages39-42
Number of pages4
StatePublished - Dec 1 2007
Event9th International Workshop on Principles of Software Evolution, IWPSE 2007, Held in Conjunction with the 6th ESEC/FSE Joint Meeting - Dubrovnik, Croatia
Duration: Sep 3 2007Sep 4 2007

Publication series

Name9th International Workshop on Principles of Software Evolution, IWPSE 2007, Held in Conjunction with the 6th ESEC/FSE Joint Meeting

Conference

Conference9th International Workshop on Principles of Software Evolution, IWPSE 2007, Held in Conjunction with the 6th ESEC/FSE Joint Meeting
CountryCroatia
CityDubrovnik
Period9/3/079/4/07

Fingerprint

Finite automata
Large scale systems
Network protocols
Costs

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Software

Cite this

Subramaniam, M., Chundi, P., & Siy, H. (2007). Aggregating changes to efficiently check consistency. In 9th International Workshop on Principles of Software Evolution, IWPSE 2007, Held in Conjunction with the 6th ESEC/FSE Joint Meeting (pp. 39-42). (9th International Workshop on Principles of Software Evolution, IWPSE 2007, Held in Conjunction with the 6th ESEC/FSE Joint Meeting).

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

9th International Workshop on Principles of Software Evolution, IWPSE 2007, Held in Conjunction with the 6th ESEC/FSE Joint Meeting. 2007. p. 39-42 (9th International Workshop on Principles of Software Evolution, IWPSE 2007, Held in Conjunction with the 6th ESEC/FSE Joint Meeting).

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

Subramaniam, M, Chundi, P & Siy, H 2007, Aggregating changes to efficiently check consistency. in 9th International Workshop on Principles of Software Evolution, IWPSE 2007, Held in Conjunction with the 6th ESEC/FSE Joint Meeting. 9th International Workshop on Principles of Software Evolution, IWPSE 2007, Held in Conjunction with the 6th ESEC/FSE Joint Meeting, pp. 39-42, 9th International Workshop on Principles of Software Evolution, IWPSE 2007, Held in Conjunction with the 6th ESEC/FSE Joint Meeting, Dubrovnik, Croatia, 9/3/07.
Subramaniam M, Chundi P, Siy H. Aggregating changes to efficiently check consistency. In 9th International Workshop on Principles of Software Evolution, IWPSE 2007, Held in Conjunction with the 6th ESEC/FSE Joint Meeting. 2007. p. 39-42. (9th International Workshop on Principles of Software Evolution, IWPSE 2007, Held in Conjunction with the 6th ESEC/FSE Joint Meeting).
Subramaniam, Mahadevan ; Chundi, Parvathi ; Siy, Harvey. / Aggregating changes to efficiently check consistency. 9th International Workshop on Principles of Software Evolution, IWPSE 2007, Held in Conjunction with the 6th ESEC/FSE Joint Meeting. 2007. pp. 39-42 (9th International Workshop on Principles of Software Evolution, IWPSE 2007, Held in Conjunction with the 6th ESEC/FSE Joint Meeting).
@inproceedings{e48a70871dad46c488ae1700af23326d,
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 Harvey Siy",
year = "2007",
month = "12",
day = "1",
language = "English (US)",
isbn = "9781595937223",
series = "9th International Workshop on Principles of Software Evolution, IWPSE 2007, Held in Conjunction with the 6th ESEC/FSE Joint Meeting",
pages = "39--42",
booktitle = "9th International Workshop on Principles of Software Evolution, IWPSE 2007, Held in Conjunction with the 6th ESEC/FSE Joint Meeting",

}

TY - GEN

T1 - Aggregating changes to efficiently check consistency

AU - Subramaniam, Mahadevan

AU - Chundi, Parvathi

AU - Siy, Harvey

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=77950529185&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77950529185&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:77950529185

SN - 9781595937223

T3 - 9th International Workshop on Principles of Software Evolution, IWPSE 2007, Held in Conjunction with the 6th ESEC/FSE Joint Meeting

SP - 39

EP - 42

BT - 9th International Workshop on Principles of Software Evolution, IWPSE 2007, Held in Conjunction with the 6th ESEC/FSE Joint Meeting

ER -