Philip J. Bernhard
- ~BoocH, G. 1991. Object Oriented Deszgn W, th App,~icattons. The Benjamin/Cummings Pub- ~lishing Company, Inc., Menlo Park, Calif. Google Scholar
- ~CHEN, M. S., CHOI, Y., AND KERSHENBAUM, A. 1990. Approaches utilizing segment overlap to ~minimize test sequences. In Protocol Specification, Testing- and Verification. Elsevier Science ~Publishers B.V, North-Holland, Amsterdam, 85-98. Google Scholar
- ~CHOW, T. S. 1978. Testing software design modeled by finite-state machines. IEEE Trans. ~Softw. Eng. SE-4, 3 (May), 178-187.Google Scholar
- ~DAHBURA, A. T., SABNANI, K., AND UYAR, M.U. 1990. Formal methods for generating protocol ~conformance test sequences. Proc. IEEE (Aug.), 1317-1326.Google Scholar
- ~FUJIWARA, S., BOCHMANN, G. V., KHENDEK, F., AMALOU, M., AND GHEDAMSI, A. 1991. Test ~selection based on finite state models. IEEE Trans. Softw. Eng. 17, 6 (June), 591 603. Google Scholar
- ~GAREY, M. R. AND JOHNSON, D.S. 1979. Computers and Intractability. W. H. Freeman and ~Company, New York. Google Scholar
- ~GmL, A. 1962. Introduction to the Theory of Finite-State Machines. McGraw-Hill, New York.Google Scholar
- ~GONENC, G. 1970. A method for the design of fault detection experiments. IEEE Trans. ~Comput. C-19, 6 (June), 551-558.Google Scholar
- ~HENNIE, F.C. 1968. Ftnite-State Models for Logical Machines. John Wiley & Sons, New York.Google Scholar
- ~HOPCROFT, J. E. ANn ULLMAN, J.D. 1979. Introductzon to Automata Theory, Languages and ~Computation. Addison-Wesley, Reading, Mass. Google Scholar
- ~HOWDEN, W. 1987. Software Engineering and Technology: Functional Program Testing and ~Analysis. McGraw-Hill, New York. Google Scholar
- ~JOHNSON, D.S. 1974. Approximation algorithms for combinatorial problems. J. Comput. Syst. ~Sci. 9,256-278.Google Scholar
- ~MOORE, E.F. 1956. Gedanken-experiments on sequential machines. In Automata Studies. ~Princeton Univ. Press, Princeton, N.J. Ann. Math. SLud. 34, 1, 129-153.Google Scholar
- ~MILLER, R. E. AND PAUL, S. 1991. Generating minimal length test sequences for conformance ~testing of communication protocols. In INFOCOM. q70-979.Google Scholar
- ~NAITO, S AND TSUNOYAMA, M 1981. Fault detection for sequential machines by transition ~tours. In IEEE Fault Tolerunt Computing' Conference. IEEE, New York.Google Scholar
- ~SABNANI, K. AND DAHBURA, A. 1988. A protocol test generation procedure. Comput. Netw. ~ISDN Syst. 15, 4, 285-297 Google Scholar
- ~SIDHU, D. P. AND LEUNG, T K. 1989. Formal methods for protocol testing: A detailed study. ~IEEE Trans. Softw. Eng. 15, 4 (Apr.), 413 426. Google Scholar
- ~VASmKEVSKn, M.P. 1973. Failure diagnosis of automata. Ktbernet~ka 4, (July Aug. h 98 108.Google Scholar
- ~YANNAKAKJS, M ANa LEE, D. 1988. Testing finite state machines. In 23rd STOC (New ~Orleans, La., May). 476-485. Google Scholar
Index Terms
- A reduced test suite for protocol conformance testing
Recommendations
Comments on “a reduced test suite for protocol conformance testing”
A previousACM TOSEM article of Ph. Bernhard (“A Reduced Test Suite of Protocol Conformance Testing,” ACM Transactions on Software Engineering and Methodology, Vol. 3, No. 3, July 1994, pages 201-220) describes three new versions of the so-called W-...
State-based models in regression test suite prioritization
Testing software products is very expensive and time consuming, especially for large software systems with extensive regression testing. During regression testing, a modified system is often re-tested using an existing test suite. Since test suites can ...
On test suite composition and cost-effective regression testing
Regression testing is an expensive testing process used to revalidate software as it evolves. Various methodologies for improving regression testing processes have been explored, but the cost-effectiveness of these methodologies has been shown to vary ...
Comments