- Full text PDF available (8)
- This year (0)
- Last 5 years (5)
- Last 10 years (11)
Journals and Conferences
The article presents the main components of the test suite architecture underlying UniTesK specification based automated test development technology, a powerful test development technology for use in industrial testing of general purpose software. The architecture presented contains such elements as automatically generated oracles, components to monitor… (More)
Principles of the UniTesK test development technology based on the use of formal models of target software are presented. This technology was developed by the RedVerst group in the Institute for System Programming, Russian Academy of Sciences (ISPRAS) , which obtained rich experience in testing and verification of complex commercial software.
Problems of testing program systems modeled by deterministic finite automata are considered. The necessary (and, sometimes, sufficient) component of such testing is a traversal of the graph of the automaton state transitions. The main attention is given to the so-called irredundant traversal algorithms (algorithms for traversing unknown graphs, or on-line… (More)
The article introduces an extension of the well-known conformance relation ioco on labeled transition systems (LTS) with refused inputs and forbidden actions. This extension helps to apply the usual formal testing theory based on LTS models to incompletely specified systems, which are often met in practice. Another topic concerned in the article is… (More)
The article presents UniTesK technology, an automated model based test construction method for use in industrial testing of general-purpose software. The approach presented includes automatic generation of test oracles from software contracts, coverage driven test sequence generation, test artifacts reuse. This work stems from the ISP RAS results of… (More)
The application of the finite automaton theory to the problem of program testing is discussed. The problem is reduced to testing a finite automaton. Testing of automatons using their state graphs, factor graphs, testing using factor graphs, and methods for factor graphs construction are discussed.
The article presents an approach to model based testing of complex systems based on a generalization of finite state machines (FSM) and input output state machines (IOSM). The approach presented is used in the context of UniTesK specification based test development method. The results of its practical applications are also discussed. Practical experience… (More)
An automaton is determined by a set of its states and transitions. The transition is a quadruple ( v , x , y , v '), where v is a pre-state, x is a stimulus, y is a reaction, and v ' is a post-state. Usually, an automaton is given by a directed graph, called the state transition graph, with the vertices and arcs of the graph being the states and… (More)