Peter Henderson
Abstract
A technique is presented whereby a significant amount of program validation can be done simply by exercising the program components in a model environment provided by a finite state machine, specially built to characterise the real environment of that component. The tools necessary to support such a technique are characterised and the merits and demerits of the technique are discussed.
- 1 Henderson P. and Snowdon R.A. "A tool for structured program development". Proc. IFIP Congress, Stockholm 1974. Information Processing North Holland.]]Google Scholar
- 2 Henderson P. and Quarendon P. "Finite state testing of structured programs". Colloque sur la Programmation, CNRS, Paris 1974. Lecture Notes in Computer Science, Springer Verlag (to appear).]] Google ScholarDigital Library
- 3 Dijkstra E.W. "Notes on Structured Programming" Structured Programming, Dahl O-J, Dijkstra E.W., Hoare C.A.R., Academic Press, 1972.]] Google ScholarDigital Library
- 4 Zurcher F. and Randell B. "Iterative multilevel modelling - a methodology for computer system design". Proc. IFIP Congress Edinburgh 1968. Information Processing 68, North Holland.]]Google Scholar
Index Terms
- Finite state modelling in program development
Recommendations
Finite state modelling in program development
Proceedings of the international conference on Reliable softwareA technique is presented whereby a significant amount of program validation can be done simply by exercising the program components in a model environment provided by a finite state machine, specially built to characterise the real environment of that ...
Mutation Analysis for Testing Finite State Machines
ISECS '09: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01Mutation analysis is a program testing method which seeds a fault in a program and tries to identify it with test data, thus promoting the test efficiency. The paper investigates the application of mutation analysis in model-based testing for the ...
Checking Completeness of Tests for Finite State Machines
In testing from a Finite State Machine (FSM), the generation of test suites which guarantee full fault detection, known as complete test suites, has been a long-standing research topic. In this paper, we present conditions that are sufficient for a test ...
Comments