Abstract
This paper introduces regular extrapolation, a technique that provides descriptions of systems or system aspects a posteriori in a largely automatic way. The descriptions come in the form of models which offer the possibility of mechanically producing system tests, grading test suites and monitoring running systems. Regular extrapolation builds models from observations via techniques from machine learning and finite automata theory. Also expert knowledge about the system enters the model construction in a systematic way. The power of this approach is illustrated in the context of a test environment for telecommunication systems.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 2(75):87–106, 1987.
E. Brinksma. A theory for the derivation of tests. Proc. of PSTV VIII, pages 63–74, 1988.
T.S. Chow. Testing software design modeled by finite-state machines. IEEE Transactions on Software Engineering, 4(3):178–187, 1978.
European Computer Manufactures Association (ECMA). Services for computer supported telecommunications applications (CSTA) phase II/III, 1994/1998.
E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of theoretical computer science. Elsevier, 1990.
J.C. Fernandez, C. Jard, T. Jéron, L. Nedelka, C. Viho. Using on-the-fly verification techniques for the generation of test suites. In Proc. CAV 1996, LNCS 1102. Springer Verlag, 1996
S. Fujiwara, G. von Bochmann, F. Khendek, M. Amalou, and A. Ghedamsi. Test selection based on finite state models. IEEE Trans. on Software Engineering, 17(6):591–603, 1991.
A. Hagerer, H. Hungar, T. Margaria, O. Niese, B. Steffen, and H.-D. Ide. Demonstration of an operational procedure for the model-based testing of CTI systems. In Proc. of the 5th Int. Conf. on Fundamental Approaches to Software Engineering (FASE 2002), this Volume.
J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
B. Jonsson, T. Margaria, G. Naeser, J. Nyström, and B. Steffen. Incremental requirement specification for evolving systems. Nordic Journal of Computing, vol. 8(1):65, Also in Proc. of Feature Interactions in Telecommunications and Software Systems 2000, 2001.
M.J. Kearns and U.V. Vazirani. An Introduction to Computational Learning Theory. MIT Press, 1994.
D. Lee and M. Yannakakis. Principles and methods of testing finite state machines — A survey. In Proc. of the IEEE, volume 84, pages 1090–1123, 1996.
A. Mazurkiewicz. Trace theory. Petri Nets, Applications and Relationship to other Models of Concurrency, LNCS 255, pages 279–324. Springer Verlag, 1987.
O. Niese, T. Margaria, A. Hagerer, M. Nagelmann, B. Steffen, G. Brune, and H. Ide. An automated testing environment for CTI systems using concepts for specification and verification of workflows. Annual Review of Communication, 54, 2000.
O. Niese, T. Margaria, and B. Steffen. Automated functional testing of web-based applications. In Proc. QWE 2001, 2001.
O. Niese, B. Steffen, T. Margaria, A. Hagerer, G. Brune, and H. Ide. Library-based design and consistency checks of system-level industrial test cases. In H. Huβmann, editor, Proc. FASE 2001, LNCS 2029, pages 233–248. Springer Verlag, 2001.
B. Steffen. Unifying models. In R. Reischuk and M. Morvan, editors, Proc. STACS’97, LNCS 1200, pages 1–20. Springer Verlag, 1997.
B. Steffen. Property oriented expansion. In Proc. Int. Static Analysis Symposium (SAS’96), LNCS 1145, pages 22–41. Springer Verlag, 996.
B. Steffen and T. Margaria. METAFrame in Practice: Design of Intelligent Network Services, LNCS 1710, pages 390–415. Springer Verlag, 1999.
Q.M. Tan and A. Petrenko. Test generation for specifications modeled by input/ output automata. In In Proc. Of 11th IFIP Workshop on Testing of Communicating Systems (IWTCS’98), pages 83–99, 1998.
J. Tretmans. Test generation with inputs, outputs, and quiescence. In Proc. TACAS’96, LNCS 1055, pages 127–146. Springer Verlag, 1996.
L.G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134–1142, 1984.
A. Valmari. On-the-fly verification with stubborn sets. In Proc. CAV 1993, LNCS 697, pages 397–408. Springer Verlag, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hagerer, A., Hungar, H., Niese, O., Steffen, B. (2002). Model Generation by Moderated Regular Extrapolation. In: Kutsche, RD., Weber, H. (eds) Fundamental Approaches to Software Engineering. FASE 2002. Lecture Notes in Computer Science, vol 2306. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45923-5_6
Download citation
DOI: https://doi.org/10.1007/3-540-45923-5_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43353-8
Online ISBN: 978-3-540-45923-1
eBook Packages: Springer Book Archive