Minimally Adequate Teacher Designs Software

We consider the problem of synthesizing UML statechart diagrams from sequence diagrams as a language inference problem, and we solve it in Angluin's framework of minimally adequate teacher. The designer has the role of teacher who answers membership and equivalence queries made by the algorithm. It turns out that there are several natural restrictions concerning the form of languages accepted by state machines. These restrictions can be used to decrease the number of membership queries needed, and thus, to make the method practically applicable.

[1]  Ismaïl Khriss,et al.  Algorithmic support for model transformation in object‐oriented software development , 2001, Concurr. Comput. Pract. Exp..

[2]  Erkki Mäkinen,et al.  Automatic synthesis of state machines from trace diagrams , 1994, Softw. Pract. Exp..

[3]  Alan W. Biermann,et al.  Constructing Programs from Example Computations , 1976, IEEE Transactions on Software Engineering.

[4]  Dana Angluin.  Negative results for equivalence queries , 1990, Mach. Learn..

[5]  Tao Jiang,et al.  Learning regular languages from counterexamples , 1988, COLT '88.

[6]  Tarja Systä,et al.  Static and Dynamic Reverse Engineering Techniques for Java Software Systems , 2000 .

[7]  Ronald L. Rivest,et al.  Inference of finite automata using homing sequences , 1989, STOC '89.

[8]  Kai Koskimies,et al.  Automated Support for Modeling OO Software , 1998, IEEE Softw..

[9]  David Chenho Kung,et al.  Formal approach to scenario analysis , 1994, IEEE Software.

[10]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[11]  Carl H. Smith,et al.  Inductive Inference: Theory and Methods , 1983, CSUR.

[12]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[13]  Mohammad Reza Mousavi,et al.  Synthesizing software architecture descriptions from Message Sequence Chart specifications , 1998, Proceedings 13th IEEE International Conference on Automated Software Engineering (Cat. No.98EX239).

[14]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[15]  Erkki Mäkinen.  On the relationship between diagram synthesis and grammatical inference erkki makinen , 1994 .

[16]  Jean G. Vaucher,et al.  From scenarios to timed automata: building specifications from users requirements , 1995, Proceedings 1995 Asia Pacific Software Engineering Conference.

[17]  Dana Angluin,et al.  Inference of Reversible Languages , 1982, JACM.