Author:
Pap Zoltán,Subramaniam Mahadevan,Kovács Gábor,Németh Gábor Árpád
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Ramalingam, G., Reps, T.: On the computational complexity of dynamic graph problems. Theoretical Computer Science 158(1-2), 233–277 (1996)
2. Sabnani, K., Dahbura, A.: A protocol test generation procedure. Computer Networks and ISDN Systems 15(4), 285–297 (1988)
3. Yannakakis, M., Lee, D.: Testing finite state machines: fault detection. In: Selected papers of the 23rd annual ACM symposium on Theory of computing, pp. 209–227 (1995)
4. Petrenko, A., Yevtushenko, N., Lebedev, A., Das, A.: Nondeterministic state machines in protocol conformance testing. In: Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems, vol. VI, pp. 363–378 (1994)
5. Lecture Notes in Computer Science;M. Subramaniam,2006
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Augmenting Field Data for Testing Systems Subject to Incremental Requirements Changes;ACM Transactions on Software Engineering and Methodology;2017-01-31
2. Delta-Oriented FSM-Based Testing;Formal Methods and Software Engineering;2015
3. On Distributed Multi-Point Concurrent Test System and Its Implementation;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2009