Abstract
In this paper, we review behavior-based model construction from a point of view characterized by verification, model checking and abstract interpretation. It turns out that abstract interpretation is the key for scaling known learning techniques for practical applications, model checking may serve as a teaching aid in the learning process underlying the model construction, and that there are also synergies with other validation and verification techniques. We will illustrate our discussion by means of a realistic telecommunication scenario, where the underlying system has grown over the last two decades, the available system documentation consists of not much more than user manuals and protocol standards, and the revision cycle times are extremely short. In this situation, behavior-based model construction provides a sound basis e.g. for test-suite design and maintenance, test organization, and test evaluation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 2(75):87–106, 1987.
T.S. Chow. Testing software design modeled by finite-state machines. IEEE Transactions on Software Engineering, 4(3):178–187, 1978.
E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of theoretical computer science. Elsevier, 1990.
A. Groce, D. Peled, and M. Yannakakis. Adaptive model checking. In J.-P. Katoen and P. Stevens, editors, Proc. of the 8th Int. Conference for Tools and Algorithms for the Construction and Analysis of Systems, volume 2280 of Lecture Notes in Computer Science, pages 357–370. Springer Verlag, 2002.
A. Hagerer, H. Hungar, O. Niese, and B. Steffen. Model generation by moderated regular extrapolation. In R. Kutsche and H. Weber, editors, Proc. of the 5th Int. Conference on Fundamental Approaches to Software Engineering (FASE’ 02), volume 2306 of Lecture Notes in Computer Science, pages 80–95. Springer Verlag, 2002.
A. Hagerer, T. Margaria, O. Niese, B. Steffen, G. Brune, and H. Ide. Efficient regression testing of CTI-systems: Testing a complex call-center solution. In Annual Review of Communication, volume 55. Int. Engineering Consortium (IEC), 2001.
J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
M.J. Kearns and U.V. Vazirani. An Introduction to Computational Learning Theory. MIT Press, 1994.
K. J. Lang, B. A. Pearlmutter, and R. A. Price. Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In Proc. 4th International Colloquium on Grammatical Inference-ICGI’ 98, LNAI 1433, pages 1–12. Springer, 1998.
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. In W. Brauer et al., editors, Petri Nets, Applications and Relationship to other Models of Concurrency, volume 255 of Lecture Notes in Computer Science, pages 279–324. Springer Verlag, 1987.
E.F. Moore. Gedanken-experiments on sequential machines. Annals of Mathematics Studies (34), Automata Studies, pages 129–153, 1956.
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. of the 4th Int. Conference on Fundamental Approaches to Software Engineering (FASE’ 01), volume 2029 of Lecture Notes in Computer Science, pages 233–248. Springer Verlag, 2001.
D. Peled, M.Y. Vardi, and M. Yannakakis. Black box checking. In Jianping Wu, Samuel T. Chanson, and Qiang Gao, editors, Proc. of the Joint Int. Conference on Formal Description Techniques for Distributed System and Communication/Protocols and Protocol Specification, Testing and Verification (FORTE/PSTV’ 99), pages 225–240. Kluwer Academic Publishers, 199
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. of the 5th Int. Conference on Computer Aided Verification (CAV’ 93), volume 697 of Lecture Notes in Computer Science, pages 397–408. Springer Verlag, 1993.
M.P. Vasilevskii. Failure diagnosis of automata. Kibernetika, 4:98–108, 1973.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Steffen, B., Hungar, H. (2003). Behavior-Based Model Construction. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2003. Lecture Notes in Computer Science, vol 2575. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36384-X_3
Download citation
DOI: https://doi.org/10.1007/3-540-36384-X_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00348-9
Online ISBN: 978-3-540-36384-2
eBook Packages: Springer Book Archive