Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case

Authors:
I. B. Bourdonov;A. S. Kossatchev;V. V. Kuliamin
Affiliations:
Institute for System Programming, Russian Academy of Sciences, Bol'shaya Kommunisticheskaya ul. 25, Moscow, 109004 Russia kos@ispras.ru, kuliamin@ispras.ru igor@ispras.ru;Institute for System Programming, Russian Academy of Sciences, Bol'shaya Kommunisticheskaya ul. 25, Moscow, 109004 Russia kos@ispras.ru, kuliamin@ispras.ru igor@ispras.ru;Institute for System Programming, Russian Academy of Sciences, Bol'shaya Kommunisticheskaya ul. 25, Moscow, 109004 Russia kos@ispras.ru, kuliamin@ispras.ru igor@ispras.ru
Venue:
Programming and Computing Software
Year:
2003

Citing 11
Cited 6

Protocol testing: review of methods and relevance for software testing

ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
Distributed Algorithms for Unidirectional Networks

SIAM Journal on Computing
ClassBench: a framework for automated class testing

Software—Practice & Experience
Computing with snakes in directed networks of automata

Journal of Algorithms
Testing deterministic implementations from nondeterministic FSM specifications

Selected proceedings of the IFIP TC6 9th international workshop on Testing of communicating systems
Sequential abstract-state machines capture sequential algorithms

ACM Transactions on Computational Logic (TOCL)
Exploring Unknown Environments

SIAM Journal on Computing
Formal Derivation of Finite State Machines for Class Testing

ZUM '98 Proceedings of the 11th International Conference of Z Users on The Z Formal Specification Notation
UniTesK Test Suite Architecture

FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages
Exploring an unknown graph

Journal of Graph Theory

The UniTesK Approach to Designing Test Suites

Programming and Computing Software
Irredundant Algorithms for Traversing Directed Graphs: The Nondeterministic Case

Programming and Computing Software
Traversal of an Unknown Directed Graph by a Finite Robot

Programming and Computing Software
Formalization of test experiments

Programming and Computing Software
Bug localization by constructing reduced traces

Programming and Computing Software
Complete open-state testing of limitedly nondeterministic systems

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 algorithms), which do not require an a priori knowledge of the total graph structure.