Design Recovery: findloop

One of the aims of the reverse engineering is to recover the design of an existing system from the run time behavior of its implementation. In this project, we consider the reverse engineering of the design of an existing concurrent system from a given set of observations of its implementations. Here, a given set of observations consists of individual linearizations of a set of MSCs that is not given.

findloop (2004-2006) is a s/w tool implemented in C++ by Yann Busnel, Yan Gao, Yves-Pol Denielou, and Shen Wang. The input of findloop is a finite set of observations of an existing concurrent system where each observation must be represented as a text file. The output of findloop is a stream that describes the resulting MSC graph.

findloop currently consists of 3 versions: findloop-0.1, findloop-0.2, and findloop-0.3. Each version is based on an algorithm for constructing an MSC graph, under the assumptions identified here, from a given set of observations.

The construction algorithms used to implement findloop-0.1, findloop-0.2, and findloop-0.3 can be found in the following references, respectively:

Ural, H., Yenigun, H., Towards design recovery from observations. Proc. of IFIP FORTE'04, Madrid, Spain, Sept. 2004, pp.133-149. (LNCS 3235).

Jourdan, G.-V., Ural, H., Yenigun, H., Recovering the lattice of repetitive sub-functions. Proc. of ISCIS'05, Istanbul, Turkey, Oct. 2005, pp.956-965. (LNCS 3733).

Jourdan, G.-V., Ural, H., Yenigun, H., Wang, S., Recovering repetitive sub-functions from observations. Submitted for publication.
Home