Using dominators to extract observable protocol contexts

Mahadevan Subramaniam, Jiangfan Shi

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

2 Citations (Scopus)

Abstract

While verifying complex protocols, it is often fruitful to consider all protocol contexts in which an interesting set of transitions may appear. The contexts are represented as yet another protocol called observable protocol that may be further analyzed. An efficient approach based on static analysis to compute an over-approximated protocol that includes all the runs of an observable protocol is described. The approach uses dominator relations over state and message dependency graphs. An over-approximation of transitions that occur with an interesting transition in any run are produced, from which a transition relation of the over-approximated protocol is automatically generated. To facilitate systematic state space exploration of the over approximated protocol, it is shown how a series of under-approximations can be generated by identifying parallelism among the transitions using dominators. The effectiveness of the proposed approach is illustrated by model checking several examples including several coherence protocols.

Original languageEnglish (US)
Title of host publicationProceedings - 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005
Pages96-105
Number of pages10
DOIs
StatePublished - Dec 1 2005
Event3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005 - Koblenz, Germany
Duration: Sep 7 2005Sep 9 2005

Publication series

NameProceedings - 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005

Conference

Conference3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005
CountryGermany
CityKoblenz
Period9/7/059/9/05

Fingerprint

Network protocols
Model checking
Static analysis

ASJC Scopus subject areas

  • Software

Cite this

Subramaniam, M., & Shi, J. (2005). Using dominators to extract observable protocol contexts. In Proceedings - 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005 (pp. 96-105). [1575898] (Proceedings - 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005). https://doi.org/10.1109/SEFM.2005.53

Using dominators to extract observable protocol contexts. / Subramaniam, Mahadevan; Shi, Jiangfan.

Proceedings - 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005. 2005. p. 96-105 1575898 (Proceedings - 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005).

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

Subramaniam, M & Shi, J 2005, Using dominators to extract observable protocol contexts. in Proceedings - 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005., 1575898, Proceedings - 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005, pp. 96-105, 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005, Koblenz, Germany, 9/7/05. https://doi.org/10.1109/SEFM.2005.53
Subramaniam M, Shi J. Using dominators to extract observable protocol contexts. In Proceedings - 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005. 2005. p. 96-105. 1575898. (Proceedings - 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005). https://doi.org/10.1109/SEFM.2005.53
Subramaniam, Mahadevan ; Shi, Jiangfan. / Using dominators to extract observable protocol contexts. Proceedings - 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005. 2005. pp. 96-105 (Proceedings - 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005).
@inproceedings{6dc019daccee4787a6d27265f1093077,
title = "Using dominators to extract observable protocol contexts",
abstract = "While verifying complex protocols, it is often fruitful to consider all protocol contexts in which an interesting set of transitions may appear. The contexts are represented as yet another protocol called observable protocol that may be further analyzed. An efficient approach based on static analysis to compute an over-approximated protocol that includes all the runs of an observable protocol is described. The approach uses dominator relations over state and message dependency graphs. An over-approximation of transitions that occur with an interesting transition in any run are produced, from which a transition relation of the over-approximated protocol is automatically generated. To facilitate systematic state space exploration of the over approximated protocol, it is shown how a series of under-approximations can be generated by identifying parallelism among the transitions using dominators. The effectiveness of the proposed approach is illustrated by model checking several examples including several coherence protocols.",
author = "Mahadevan Subramaniam and Jiangfan Shi",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/SEFM.2005.53",
language = "English (US)",
isbn = "0769524354",
series = "Proceedings - 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005",
pages = "96--105",
booktitle = "Proceedings - 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005",

}

TY - GEN

T1 - Using dominators to extract observable protocol contexts

AU - Subramaniam, Mahadevan

AU - Shi, Jiangfan

PY - 2005/12/1

Y1 - 2005/12/1

N2 - While verifying complex protocols, it is often fruitful to consider all protocol contexts in which an interesting set of transitions may appear. The contexts are represented as yet another protocol called observable protocol that may be further analyzed. An efficient approach based on static analysis to compute an over-approximated protocol that includes all the runs of an observable protocol is described. The approach uses dominator relations over state and message dependency graphs. An over-approximation of transitions that occur with an interesting transition in any run are produced, from which a transition relation of the over-approximated protocol is automatically generated. To facilitate systematic state space exploration of the over approximated protocol, it is shown how a series of under-approximations can be generated by identifying parallelism among the transitions using dominators. The effectiveness of the proposed approach is illustrated by model checking several examples including several coherence protocols.

AB - While verifying complex protocols, it is often fruitful to consider all protocol contexts in which an interesting set of transitions may appear. The contexts are represented as yet another protocol called observable protocol that may be further analyzed. An efficient approach based on static analysis to compute an over-approximated protocol that includes all the runs of an observable protocol is described. The approach uses dominator relations over state and message dependency graphs. An over-approximation of transitions that occur with an interesting transition in any run are produced, from which a transition relation of the over-approximated protocol is automatically generated. To facilitate systematic state space exploration of the over approximated protocol, it is shown how a series of under-approximations can be generated by identifying parallelism among the transitions using dominators. The effectiveness of the proposed approach is illustrated by model checking several examples including several coherence protocols.

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

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

U2 - 10.1109/SEFM.2005.53

DO - 10.1109/SEFM.2005.53

M3 - Conference contribution

AN - SCOPUS:84883278287

SN - 0769524354

SN - 9780769524351

T3 - Proceedings - 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005

SP - 96

EP - 105

BT - Proceedings - 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005

ER -