Testing, optimizaton, and games

Proceedings - Symposium on Logic in Computer Science

Volumn 19, Issue , 2004, Pages 78-88

  Yannakakis, Mihalis ^a  

^a Fu Foundation School of Engineering and Applied Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONFORMANCE TESTING; FINITE STATE MACHINES; MODEL CHECKING; REACTIVE SYSTEMS;

ALGORITHMS; APPROXIMATION THEORY; FINITE AUTOMATA; LEARNING SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

SOFTWARE ENGINEERING;

EID: 4544283730     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. A. V. Aho, A. T. Dahbura, D. Lee, and M. U. Uyar. An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours. IEEE Trans. on Communication, vol. 39, no. 11, pp. 1604-15, 1991.
2. R. Alur, C. Courcoubetis, and M. Yannakakis. Distinguishing tests for nondeterministic and probabilistic ma chines. Proc. 27th Ann. ACM Symp. on Theory of Computing, pp. 363-372, 1995.
3. R. Alur and M. Yannakakis. Model checking of hierarchical state machines. ACM Trans. on Progr. Languages and Systems, 23(3):273-303, 2001.
4. D. Angluin. Learning regular sets from queries and counterexamples. Inform, and Comp., 75, pp. 87-106, 1987.
5. L. Apfelbaum. Automated functional test generation. Proc. IEEE Autotestcon Conference, 1995.
6. G. Booch, I. Jacobson, and J. Rumbaugh. Unified Modeling Language User Guide. Addison Wesley, 1997.
7. E. Brinksma and J. Tretmans. Testing transition systems: An annotated bibliography. Proc. MOVEP, Springer Verlag LNCS 2067, pp. 187-195, 2001.
8. T. S. Chow, Testing software design modeled by finite-state machines. IEEE Trans. on Software Engineering, vol. SE-4, no. 3, pp. 178-87, 1978.
9. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking, MIT Press 2000.
10. J. Edmonds and E.L. Johnson. Matching, Euler tours and the Chinese postman. Mathematical Programming, vol. 5, pp. 88-124, 1973.
11. K. Etessami and M. Yannakakis. From Rule-Based to Automata-Based Testing. Proc. IFIP Joint Intl. Conf. FORTE XIII-PSTV XX, Kluwer, pp. 53-68, 2000.
12. G. Friedman, A. Hartman, K. Nagin, and T. Shiran. Projected state machine coverage for software testing. Proc. ISSTA, 2002.
13. A. Frieze, G. Galbiati, and F. Maffioli. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12, 23-39, 1982.
14. A. Groce, D. Peled, and M. Yannakakis. Adaptive model checking. Proc. TACAS, Springer Verlag LNCS 2280, pp. 357-370, 2002.
15. D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8:231-274, 1987.
16. F. C. Hennie. Fault detection experiments for sequential circuits. Proc. 5th Annual Symp. Switching Circuit Theory and Logical Design, pp. 95-110, 1964
17. G. Holzmann, D. A. Peled, and M. H. Redberg. Design tools for requirements engineering. Bell Labs Technical Journal, 2:86-95, 1997.
18. H. S. Hong, I. Lee, O. Sokolsky, and H. Ural. A temporal logic based theory of test coverage and generation. Proc. TACAS, pp. 327-341, 2002.
19. D. Lee and M. Yannakakis, On-line minimization of transition systems. Proc. 24th Ann. ACM Symp. on Theory of Computing, pp. 264-274, 1992.
20. D. Lee and M. Yannakakis, Testing finite state machines: state identification and verification. IEEE Trans. on Computers, vol. 43, no. 3, pp. 306-320, 1994.
21. D. Lee and M. Yannakakis. Optimization problems from feature testing of communication protocols. In Proc. Intl. Conf. on Network Protocols, pages 66-75, 1996.
22. D. Lee and M. Yannakakis. Principles and methods of testing finite state machines - a survey. Proc. of IEEE, 84(8):1090-1123, 1996.
23. E. F. Moore, Gedanken-experiments on sequential machines. Automata Studies, Annals of Mathematics Studies, Princeton University Press, no. 34, pp. 129-153, 1956.
24. D. Mosk-Aoyama and M. Yannakakis. Testing Hierarchical Systems via Edge Covering, manuscript. 2004
25. S. Naito and M. Tsunoyama, Fault detection for sequential machines by transitions tours. Proc. IEEE Fault Tolerant Comput. Symp., IEEE Computer Society Press, pp. 238-43, 1981.
26. D. Peled, M. Vardi, and M. Yannakakis. Black box checking. Journal of Automata, Languages and Combinatorics, 7(2), pp. 225-246, 2002.
27. A. Petrenko. Fault model-driven test derivation from finite state models: Annotated bibliography Proc. MOVEP, Springer Verlag LNCS 2067, pp. 196-205, 2001.
28. J. Reif. The complexity of two-player games with incomplete information. J. Computer and System Sciences, 29, pp. 274-301, 1984.
29. R. L. Rivest and R. E. Schapire, Inference of finite automata using homing sequences. Proc. 21st Ann. Symp. on Theory of Computing, pp.411-420, 1989.
30. J. Tretmans. Test generation with inputs, outputs amd repetitive quiescence. Software - Concepts and Tools, 17(3), pp. 103-120, 1996.
31. http:/cm.bell-labs.com/cm/cs/what/ubet.
32. M. P. Vasilevskii, Failure diagnosis of automata. Kibernetika, no. 4, pp. 98-108, 1973.
33. M. Yannakakis and D. Lee, Testing finite state machines: fault detection. J. of Computer and System Sciences, Vol. 50, No. 2, pp. 209-227, 1995.