skip to main content
10.1145/2811411.2811552acmconferencesArticle/Chapter ViewAbstractPublication PagesracsConference Proceedingsconference-collections
research-article

Unsupervised test model reconstruction from conformance test logs

Published: 09 October 2015 Publication History

Abstract

The high manpower cost of test model generation is a big obstacle for model based testing. In this paper, we propose a method that decreases this cost for the case of performance testing of telecommunication systems. The test model which is typically a deterministic finite state machine is partially derived from execution logs of black box system tests by means of statistical methods and then manually minimized. A sequential pattern mining algorithm is used for identifying frequently observed event sequences, from which it is possible to identify partitions of states of the machine and set up functional dependencies among them. Our method in contrast to other methods is passive and unsupervised it does neither require access to the black box system to be learnt, nor the input sequences to be finite. However, the equivalence of some states cannot be proven, therefore the model has to be finalized manually. We show experimental results on random incompletely specified FSMs and sets of random walk traces to evaluate the efficiency of our method.

References

[1]
R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases, VLDB '94, pages 487--499, San Francisco, CA, USA, 1994. Morgan Kaufmann Publishers Inc.
[2]
D. Angluin. Learning regular sets from queries and counterexamples. Inf. Comput., 75(2):87--106, Nov. 1987.
[3]
J. Balcázar, J. Díaz, R. Gavaldà, and O. Watanabe. Algorithms for learning finite automata from queries: A unified view. In D.-Z. Du and K.-I. Ko, editors, Advances in Algorithms, Languages, and Complexity, pages 53--72. Springer US, 1997.
[4]
H. Barringer, D. Giannakopoulou, and C. S. Pasareanu. Proof rules for automated compositional verification through learning. In In Proc. SAVCBS Workshop, pages 14--21, 2003.
[5]
A. Hagerer, H. Hungar, O. Niese, and B. Steffen. Model generation by moderated regular extrapolation. In R.-D. Kutsche and H. Weber, editors, Fundamental Approaches to Software Engineering, volume 2306 of Lecture Notes in Computer Science, pages 80--95. Springer Berlin Heidelberg, 2002.
[6]
F. Howar, B. Steffen, and M. Merten. Automata learning with automated alphabet abstraction refinement. In Proceedings of the 12th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI'11, pages 263--277, Berlin, Heidelberg, 2011. Springer-Verlag.
[7]
H. Hungar, O. Niese, and B. Steffen. Domain-specific optimization in automata learning. In J. Hunt, Warren A. and F. Somenzi, editors, Computer Aided Verification, volume 2725 of Lecture Notes in Computer Science, pages 315--327. Springer Berlin Heidelberg, 2003.
[8]
D. Lee and M. Yannakakis. Principles and methods of testing finite state machines-a survey. Proceedings of the IEEE, 84(8):1090--1123, Aug 1996.
[9]
K. Li, R. Groz, and M. Shahbaz. Integration testing of components guided by incremental state machine learning. In P. McMinn, editor, TAIC PART, pages 59--70. IEEE Computer Society, 2006.
[10]
C. Pfleeger. State reduction in incompletely specified finite-state machines. Computers, IEEE Transactions on, C-22(12):1099--1102, Dec 1973.
[11]
G. L. Prajapati. Advances in learning formal languages. In International MultiConference of Engineers and Computer Scientists, IMECS 2011, pages 118--126, Hong Kong, 16--18 March 2011. International Association of Engineers.
[12]
R. L. Rivest and R. E. Schapire. Inference of finite automata using homing sequences. In Proceedings of the Twenty-first Annual ACM Symposium on Theory of Computing, STOC '89, pages 411--420, New York, NY, USA, 1989. ACM.
[13]
M. Shahbaz, K. Li, and R. Groz. Learning parameterized state machine model for integration testing. In Computer Software and Applications Conference, 2007. COMPSAC 2007. 31st Annual International, volume 2, pages 755--760, July 2007.
[14]
R. Srikant and R. Agrawal. Mining sequential patterns: Generalizations and performance improvements. In Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology, EDBT '96, pages 3--17, London, UK, UK, 1996. Springer-Verlag.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
RACS '15: Proceedings of the 2015 Conference on research in adaptive and convergent systems
October 2015
540 pages
ISBN:9781450337380
DOI:10.1145/2811411
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 October 2015

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. FSM learning
  2. model based testing
  3. sequential pattern mining
  4. unsupervised

Qualifiers

  • Research-article

Conference

RACS '15
Sponsor:

Acceptance Rates

RACS '15 Paper Acceptance Rate 75 of 309 submissions, 24%;
Overall Acceptance Rate 393 of 1,581 submissions, 25%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 42
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 19 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media