Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
A protocol test generation procedure
Computer Networks and ISDN Systems
Formal Methods for Protocol Testing: A Detailed Study
IEEE Transactions on Software Engineering
An improved protocol test generation procedure based on UIOS
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Design and validation of computer protocols
Design and validation of computer protocols
An optimization technique for protocol conformance testing using multiple UIO sequences
Information Processing Letters
Protocol conformance test generation using multiple UIO sequences with overlapping
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Online minimization of transition systems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Testing finite state machines: fault detection
Selected papers of the 23rd annual ACM symposium on Theory of computing
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Protocol Conformance Testing Using Multiple UIO Sequences
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
Approaches utilizing segment overlap to minimize test sequences
Proceedings of the IFIP WG6.1 Tenth International Symposium on Protocol Specification, Testing and Verification X
Distinguishing tests for nondeterministic and probabilistic machines
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On Minimizing the Lengths of Checking Sequences
IEEE Transactions on Computers
Efficient computation of unique input/output sequences in finite-state machines
IEEE/ACM Transactions on Networking (TON)
DAC '98 Proceedings of the 35th annual Design Automation Conference
Specification-based Testing for Gui-based Applications
Software Quality Control
Reduced Length Checking Sequences
IEEE Transactions on Computers
Expressing Graphical User's Input for Test Specifications
EDCIS '02 Proceedings of the First International Conference on Engineering and Deployment of Cooperative Information Systems
Fault Model-Driven Test Derivation from Finite State Models: Annotated Bibliography
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Conformance Testing Techniques for Timed Systems
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Towards Specification-based Web Testing
Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing
Fault model-driven test derivation from finite state models: annotated bibliography
Modeling and verification of parallel processes
Confirming Configurations in EFSM Testing
IEEE Transactions on Software Engineering
A Method Enabling Feasible Conformance Test Sequence Generation for EFSM Models
IEEE Transactions on Computers
Conformance testing in the presence of multiple faults
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Testing from Partial Deterministic FSM Specifications
IEEE Transactions on Computers
Generating optimal distinguishing sequences with a model checker
A-MOST '05 Proceedings of the 1st international workshop on Advances in model-based testing
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Separating sequence overlap for automated test sequence generation
Automated Software Engineering
Achieving communication coverage in testing
ACM SIGSOFT Software Engineering Notes
Ant colony optimisation for generation of conformance testing sequences using a characterising set
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
Using adaptive distinguishing sequences in checking sequence constructions
Proceedings of the 2008 ACM symposium on Applied computing
An EFSM-based test generation for validation of SDL specifications
Proceedings of the 3rd international workshop on Automation of software test
Advanced method for cryptographic protocol verification
Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science, Software Engineering, Information Technology, e-Business, and Applications, 2004
Using formal specifications to support testing
ACM Computing Surveys (CSUR)
Evolutionary generation of unique input/output sequences for class behavioral testing
Computers & Mathematics with Applications
Validation of SDL specifications using EFSM-based test generation
Information and Software Technology
Complete open-state testing of limitedly nondeterministic systems
Programming and Computing Software
Estimating the feasibility of transition paths in extended finite state machines
Automated Software Engineering
Nature-inspired techniques for conformance testing of object-oriented software
Applied Soft Computing
Generating checking sequences for a distributed test architecture
TestCom'03 Proceedings of the 15th IFIP international conference on Testing of communicating systems
Verification across intellectual property boundaries
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Learning finite automata using label queries
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
FSM-based conformance testing methods: A survey annotated with experimental evaluation
Information and Software Technology
Preset and adaptive homing experiments for nondeterministic finite state machines
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Information and Software Technology
Using distinguishing and UIO sequences together in a checking sequence
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Reducing the lengths of checking sequences by overlapping
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Generalizing redundancy elimination in checking sequences
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Conditions for avoiding controllability problems in distributed testing
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Eliminating redundant tests in a checking sequence
TestCom'05 Proceedings of the 17th IFIP TC6/WG 6.1 international conference on Testing of Communicating Systems
ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part II
Research: Construction of checking sequences based on characterization sets
Computer Communications
The complexity of asynchronous model based testing
Theoretical Computer Science
Validation of SDL-based architectural design models using communication-based coverage criteria
Information and Software Technology
Testing input/output partial order automata
TestCom'07/FATES'07 Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems
Verification of initial-state opacity in security applications of discrete event systems
Information Sciences: an International Journal
Runtime analysis of the (1+1) EA on computing unique input output sequences
Information Sciences: an International Journal
| Hi-index | 14.99 |
We study the complexity of two fundamental problems in the testing of finite-state machines. 1) Distinguishing sequences (state identification). We show that it is PSPACE-complete to determine whether a finite-state machine has a preset distinguishing sequence. There are machines that have distinguishing sequences, but only of exponential length. We give a polynomial time algorithm that determines whether a finite-state machine has an adaptive distinguishing sequence. (The previous classical algorithms take exponential time.) Furthermore, if there is an adaptive distinguishing sequence, then we give an efficient algorithm that constructs such a sequence of length at most n(n/spl minus/1)/2 (which is the best possible), where n is the number of states. 2) Unique input output sequences (state verification). It is PSPACE-complete to determine whether a state of a machine has a unique input output sequence. There are machines whose states have unique input output sequences but only of exponential length.