Recovering Repetitive Sub-functions from Observations

Authors:
Guy-Vincent Jourdan;Hasan Ural;Shen Wang;Hüsnü Yenigün
Affiliations:
School of Information Technology and Engineering (SITE), University of Ottawa, 800 King Edward Avenue, Ottawa, Ontario, K1N 6N5, Canada;School of Information Technology and Engineering (SITE), University of Ottawa, 800 King Edward Avenue, Ottawa, Ontario, K1N 6N5, Canada;School of Information Technology and Engineering (SITE), University of Ottawa, 800 King Edward Avenue, Ottawa, Ontario, K1N 6N5, Canada;Faculty of Engineering and Natural Sciences, Sabancı University, Tuzla, Istanbul, 34956, Turkey
Venue:
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Year:
2007

Citing 9
Cited 0

Text algorithms

Text algorithms
Tutorial on message sequence charts

Computer Networks and ISDN Systems - Special issue on SDL and MSC
Inference of message sequence charts

Proceedings of the 22nd international conference on Software engineering
Detecting implied scenarios in message sequence chart specifications

Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Reverse Engineering and Design Recovery: A Taxonomy

IEEE Software
Syntactic Detection of Process Divergence and Non-local Choice inMessage Sequence Charts

TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Model Checking of Message Sequence Charts

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Inference of Message Sequence Charts

IEEE Transactions on Software Engineering
Recovering the lattice of repetitive sub-functions

ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper proposes an algorithm which, given a set of observations of an existing concurrent system that has repetitive sub-functions, constructs a Message Sequence Charts (MSC) graph where repetitive sub-functions of the concurrent system are identified. This algorithm makes fewer assumptions than previously published work, and thus requires fewer and easier to generate observations to construct the MSC-graph. The constructed MSC-graph may then be used as input to existing synthesis algorithms to recover the design of the existing concurrent system.