Minimally adequate teacher synthesizes statechart diagrams

Acta Informatica

Volumn 38, Issue 4, 2002, Pages 235-259

  Mäkinen, Erkki ^a   Systä, Tarja ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE QUERIES; LANGUAGE INFERENCE; MEMBERSHIP QUERY; SEQUENCE DIAGRAMS; STATE CHART DIAGRAMS; UML STATECHART DIAGRAMS;

ALGORITHMS;

EID: 23044531353     PISSN: 00015903     EISSN: 14320525     Source Type: Journal    
DOI: 10.1007/s236-002-8033-8     Document Type: Review

References (32)

1. D. Angluin: Inductive inference of formal languages from positive data. Inform. Contr. 45, 117-135 (1980)
2. D. Angluin: A note on the number of queries needed to identify regular languages. Inform. Contr. 51, 76-87 (1982)
3. D. Angluin: Learning regular sets from queries and counterexamples. Inf. Comput. 75, 87-106 (1987)
4. D. Angluin: Negative results for equivalence queries. Mach. Learn. 5, 121-150 (1990)
5. D. Angluin, C.H. Smith: Inductive inference: theory and methods. ACM Comput. Surv. 15, 237-269 (1983)
6. J.L. Balcázar, J. Diaz, R. Gavaldà, O. Watanabe: Algorithms for learning finite automata from queries: a unified view. In D.-Z. Du, K.-I. Ko (eds.), Advances in Algorithms, Languages, and Complexity, pp. 73-91. Dordrecht: Kluwer Academic Publishers 1997
7. A.W. Biermann, R. Krishnaswamy: Constructing programs from example computations. IEEE Trans. Softw. Eng. SE-2, 141-153 (1976)
8. A. Birkendorf, A. Böker, H.U. Simon: Learning deterministic finite automata from smallest counterexamples. In Proc. 9th ACM/SIAM Symp. Discr. Alg. (SODA), Baltimore, USA, January 1999, pp. 599-608
9. E.M. Gold: Language identification in the limit. Inform. Contr. 10, 447-474 (1967)
10. E.M. Gold: Complexity of automaton identification from given data. Inform. Contr. 37, 302-320 (1978)
11. D. Harel: Statecharts: A visual formalism for complex systems: Sci. Comput. Program. 8, 231-274 (1987)
12. D.Harel, H. Kugler: Synthesizing state-based object systems from LSC specifications. In Proc. Fifth Int. Conf. on Implementation and Application of Automata (CIAA 2000)
13. M.A. Harrison: Introduction to Formal Language Theory. Reading, MA: Addison-Wesley 1978
14. P. Hsia, J. Samuel, J. Gao, D. Kung, Y. Toyoshima, C. Chen: Formal approach to scenario analysis. IEEE Softw. 11, 33-41 (1994)
15. O.H. Ibarra, T. Jiang: Learning regular languages from counterexamples. J. Comput. Syst. Sci. 43, 299-316 (1991)
16. Z. 120 ITU-T Recommendation Z. 120: Message Sequence Chart (MSC). ITU-T, Geneva 1996
17. K. Koskimies, E. Mäkinen: Automatic synthesis of state machines from trace diagrams. Softw. Pract. Exper. 24, 643-658 (1994)
18. K. Koskimies, T. Systä, J. Tuomi, T. Männistö: Automated support for modeling OO software. IEEE Softw. 15, 87-94 (1998)
19. J. Koskinen, E. Mäkinen, T. Systä: Minimally adequate synthesizer tolerates inaccurate information during behavioral modeling. In Proc. of SCASE'01, Enschede, The Netherlands, February 2001
20. I. Krüger, R. Grosu, P. Scholz, M. Broy: From MSCs to statecharts. In F.J. Rammig (ed.), Distributed and Parallel Embedded Systems, pp. 61-71. Dordrecht: Kluwer Academic Publishers 1999
21. S. Leue, L. Mehrmann, M. Rezai: Synthesizing software architecture descriptions from message sequence chart specification. In Proc. of the 13th IEEE International Conference on Automated Software Engineering (ASE98), Honolulu, USA, October 1998, pp. 192-195
22. E. Mäkinen: On the relationship between diagram synthesis and grammatical inference. Intern. J. Computer Math. 52, 129-137 (1994)
23. E. Mäkinen, T. Systä: Implementing minimally adequate syntheziser. Report A-2000-9, Dept. of Computer and Information Sciences, University of Tampere, June 2000
24. E. Mäkinen, T. Systä: MAS - an interactive synthesizer to support behavioral modeling in UML. In Proc. of the 23rd International Conference on Software Engineering, Toronto, Canada, 2001, pp. 15-24
25. Object Management Group, 2001. OMG Unified Modeling Language Specification v.1.3. [http://www.omg.org]
26. OMG Corporation: OMG XML Metadata Interchange (XMI) Specification, 2000 [http://www.omg.org]
27. R.L. Rivest, R.E. Schapire: Inference of finite automata using homing sequences. Inf. Comput. 103, 299-347 (1993)
28. J. Rumbaugh, J. Jacobson, G. Booch: The Unified Modeling Language Reference Manual. Reading, MA: Addison-Wesley 1999
29. S. Schönberger, R. Keller, I. Khriss: Algorithmic support for transformations in object-oriented software development. Technical Report GELO-83, University of Montreal, 1998
30. S. Somé, R. Dssouli, J. Vaucher: From scenarios to automata: building specifications from users requirements. In Proc. Asia Pacific Software Engineering Conference (APSEC'95), Brisbane, Australia, 1995, pp. 48-57
31. T. Systä: Static and Dynamic Reverse Engineering Techniques for Java Software Systems. Ph. D. Dissertation, Dept. of Computer and Information Sciences, University of Tampere, May 2000
32. J. Wikman: Evolution of a Distributed Repository-Based Architecture. In Proc. of the First Nordic Workshop on Software Architecture, Research Report 14/98, Dept. of Computer Science and Business Administration, University of Karlskrona/Ronneby, Sweden, 1998 [http://www.hk-r.se/fou/forskinfo.nsf/]