Property oriented test case generation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2931, Issue , 2004, Pages 147-163

  Fernandez, Jean Claude ^a   Mounier, Laurent ^a   Pachon, Cyril ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

INFINITE WORD; LINEAR PROPERTIES; PRACTICAL TESTS; SATISFIABILITY; TEST CASE; TEST CASE GENERATION;

SOFTWARE TESTING;

EID: 33750040363     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24617-6_11     Document Type: Article

References (20)

1. A. Belinfante, J. Feenstra, R. de Vries, J. Tretmans, N. Goga, L. Feijs, S. Mauw, and L. Heerink. Formal Test Automation : a Simple Experiment. In 12th International Workshop on Testing of Communicating Systems, G. Csopaki et S. Dibuz et K. Tarnay, 1999. Kluwer Academic Publishers.
2. M. Bozga, J.-C. Fernandez, and L. Ghirvu. Using static analysis to improve automatic test generation. In Tools and Algorithms for Construction and Analysis of Systems, pages 235-250, 2000.
3. E. Brinksma. A theory for the derivation of tests. In S. Aggarval and K. Sabnani, editors, Protocol Specification, Testing and Verification VIII, IFIP, pages 63-74. Elsevier Science Publishers, B.V., North-Holland, 1988.
4. J. Büchi. On a decision method in restricted second order arithmetic. In N. et al., editor, Logic, Methodology and Philosophy of Sciences. Stantford Univ. Press, 1962.
5. J.-. Fernandez, C. Jard, T. Jeron, and C. Viho. Using on-the-fly verification techniques for the generation of test suites. In CAV'96. LNCS 1102 Springer Verlag, 1996.
6. R. Groz, T. Jeron, and A. Kerbrat. Automated test generation from SDL specifications. In R. Dssouli, G. von Bochmann, and Y. Lahav, editors, SDL'99 The Next Millenium, 9th SDL Forum, Montreal, Quebec, pages 135-152, Elsevier, Juin 1999.
7. 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.
8. B. Marre and A. Arnould. Test sequences generation from lustre descriptions: Gatel. In In Fifteenth IEEE Int. Conf. on Automated Software Engineering (ASE 2000),IEEE Computer Society Press, pages 229-237, Grenoble, septembre 2000.
9. M. Mukund. Finite-state automata on infinite input. Technical report, 1996.
10. I. Parissis and J. Vassy. Test des proprietes de surete. In In Actes du colloque Modelisation de Systemes Reactifs (MSR'01), pages 563-578, Hermes, 2001.
11. M. Phalippou. Relations d'implantations et Hypothèses de Test sur des automates à entrées et sorties. Thèse de doctorat, Université de Bordeaux, France, 1994.
12. M. Phalippou. Test sequence using Estelle or SDL structure information. In FORTE'94, Berne, Oct. 1994.
13. P. Thevenod-Fosse. Unit and integration testing of lustre programs: a case study from the nuclear industry. In 9th European Workshop on Dependable Computing (EWDC-9), pages 121-124, Gdansk, Pologne, 14-16 Mai 1998.
14. M. Rabin. Automata o, Infinite Object and Church' Problem. Number 13 in Regional Conference series in mathematics. American Mathematical Society, 1972.
15. P. Raymond, D. Weber, X. Nicollin, and N. Halbwachs. Automatic testing of reactive systems. In 19th IEEE Real-Time Systems Symposium, Madrid, Spain, dec 1998.
16. S. Safra. On the complexity of ω-automata, checking, pages 319-327, 1988.
17. M. Schmitt, B. Koch, J. Grabowski, and D. Hogrefe. Autolink - A Tool for Automatic and Semi-Automatic Test Generation from SDL Specifications. Technical Report A-98-05, Medical University of Lübeck, 1998.
18. R. Tarjan. Depth-first search and linear graph algorithms. SIAM J. Computation, 2(1), june 1972.
19. J. Tretmans. Test Generation with Inputs, Outputs, and Quiescence. In T. Margaria and B. Steffen, editors, Second Int. Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'96), volume 1055 of Lecture Notes in Computer Science, pages 127-146. Springer-Verlag, 1996.
20. P. Wolper, M. Vardi, and A. Sistla. Reasoning about infinite computation paths. In 24th IEEE Symposium of Foundations of Computer Science, 1983.