Abstract
In this paper we propose an approach to automatically produce test cases allowing to check the satisfiability of a linear property on a given implementation. Linear properties can be expressed by formulas of temporal logic. An observer is built from each formula. An observer is a finite automaton on infinite sequences. Of course, testing the satisfiability of an infinite sequence is not possible. Thus, we introduce the notion of bounded properties. Test cases are generated from a (possibly partial) specification of the IUT and the property to validate is expressed by a parameterised automaton on infinite words. This approach is formally defined, and a practical test generation algorithm is sketched.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Belinfante, A., Feenstra, J., de Vries, R., Tretmans, J., Goga, N., Feijs, L., Mauw, S., Heerink, L.: Formal Test Automation: a Simple Experiment. In: Csopaki, G., Dibuz, S., Tarnay, K. (eds.) 12th International Workshop on Testing of Communicating Systems. Kluwer Academic Publishers, Dordrecht (1999)
Bozga, M., Fernandez, J.-C., Ghirvu, L.: Using static analysis to improve automatic test generation. Tools and Algorithms for Construction and Analysis of Systems, pp. 235–250 (2000)
Brinksma, E.: A theory for the derivation of tests. In: Aggarval, S., Sabnani, K. (eds.) Protocol Specification, Testing and Verification VIII, IFIP, pp. 63–74. Elsevier Science Publishers, B.V., North-Holland (1988)
Büchi, J.: On a decision method in restricted second order arithmetic. In: van Leeuwan, J., Nagel, E. (eds.) Logic, Methodology and Philosophy of Sciences. Stantford Univ. Press, Stantford (1962)
Fernandez, J.-C., Jard, C., Jéron, T., Viho, C.: Using on-the-fly verification techniques for the generation of test suites. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102. Springer, Heidelberg (1996)
Groz, R., Jeron, T., Kerbrat, A.: Automated test generation from SDL specifications. In: Dssouli, R., von Bochmann, G., Lahav, Y. (eds.) SDL 1999 The Next Millenium, 9th SDL Forum, Montreal, Quebec, Juin 1999, pp. 135–152. Elsevier, Amsterdam (1999)
OSI-Open Systems Interconnection, Information Technology - Open Systems Interconnection Conformance Testing Methodology and Framework - Part 1: General Concept - part 2: Abstract Test Suite Specification - part 3: The Tree and Tabular Combined Notation (TTCN). International Standard ISO/IEC 9646-1/2/3 (1992)
Marre, B., Arnould, A.: Test sequences generation from lustre descriptions: Gatel. In: Fifteenth IEEE Int. Conf. on Automated Software Engineering (ASE 2000), September 2000, pp. 229–237. IEEE Computer Society Press, Grenoble (2000)
Mukund, M.: Finite-state automata on infinite input. Technical report (1996)
Parissis, I., Vassy, J.: Test des proprietes de surete. In: Actes du colloque Modelisation de Systemes Reactifs (MSR 2001), Hermes, pp. 563–578 (2001)
Phalippou, M.: Relations d’implantations et Hypothèses de Test sur des automates à entrées et sorties. Thèse de doctorat. Université de Bordeaux, France (1994)
Phalippou, M.: Test sequence using Estelle or SDL structure information. In: FORTE 1994, Berne (October 1994)
Thevenod-Fosse, P.: Unit and integration testing of lustre programs: a case study from the nuclear industry. In: 9th European Workshop on Dependable Computing (EWDC-9), Gdansk, Pologne, Mai 14-16, pp. 121–124 (1998)
Rabin, M.: Automata o, Infinite Object and Church Problem. Regional Conference series in mathematics, vol. 13. American Mathematical Society, Providence (1972)
Raymond, P., Weber, D., Nicollin, X., Halbwach, N.: Automatic testing of reactive systems. In: 19th IEEE Real-Time Systems Symposium, Madrid, Spain (December 1998)
Safra, S.: On the complexity of ω-automata, checking. pp. 319–327 (1988)
Schmitt, M., Koch, B., Grabowski, J., Hogrefe, D.: Autolink - A Tool for Automatic and Semi-Automatic Test Generation from SDL Specifications. Technical Report A-98-05, Medical University of Lübeck (1998)
Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Computation 2(1) (June 1972)
Tretmans, J.: Test Generation with Inputs, Outputs, and Quiescence. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 127–146. Springer, Heidelberg (1996)
Wolper, P., Vardi, M., Sistla, A.: Reasoning about infinite computation paths. In: 24th IEEE Symposium of Foundations of Computer Science (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernandez, JC., Mounier, L., Pachon, C. (2004). Property Oriented Test Case Generation. In: Petrenko, A., Ulrich, A. (eds) Formal Approaches to Software Testing. FATES 2003. Lecture Notes in Computer Science, vol 2931. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24617-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-24617-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20894-5
Online ISBN: 978-3-540-24617-6
eBook Packages: Springer Book Archive