Please use this identifier to cite or link to this item:
|dc.title||Mining message sequence graphs|
|dc.identifier.citation||Kumar, S.,Khoo, S.-C.,Roychoudhury, A.,Lo, D. (2011). Mining message sequence graphs. Proceedings - International Conference on Software Engineering : 91-100. ScholarBank@NUS Repository. <a href="https://doi.org/10.1145/1985793.1985807" target="_blank">https://doi.org/10.1145/1985793.1985807</a>|
|dc.description.abstract||Dynamic specification mining involves discovering software behavior from traces for the purpose of program comprehension and bug detection. However, mining program behavior from execution traces is difficult for concurrent/distributed programs. Specifically, the inherent partial order relationships among events occurring across processes pose a big challenge to specification mining. In this paper, we propose a framework for mining partial orders so as to understand concurrent program behavior. Our miner takes in a set of concurrent program traces, and produces a message sequence graph (MSG) to represent the concurrent program behavior. An MSG represents a graph where the nodes of the graph are partial orders, represented as Message Sequence Charts. Mining an MSG allows us to understand concurrent program behaviors since the nodes of the MSG depict important "phases" or "interaction snippets" involving several concurrently executing processes. To demonstrate the power of this technique, we conducted experiments on mining behaviors of several fairly complex distributed systems. We show that our miner can produce the corresponding MSGs with both high precision and recall. © 2011 ACM.|
|dc.description.sourcetitle||Proceedings - International Conference on Software Engineering|
|Appears in Collections:||Staff Publications|
Show simple item record
Files in This Item:
There are no files associated with this item.
checked on Mar 30, 2020
checked on Mar 22, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.