메뉴 건너뛰기




Volumn 39, Issue 4, 1996, Pages

Extending test sequence overlap by invertibility

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0007392739     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/39.4.325     Document Type: Article
Times cited : (23)

References (16)
  • 2
    • 0002865451 scopus 로고
    • An Optimization Technique for Protocol Conformance Test Generation Based on UIO Sequences and Rural Chinese Postman Tours
    • VHL Atlantic City NJ. North-Holland Publishers
    • Aho, A. V., Dahbura, A. T., Lee, D. and Uyar, M. U. (1988) An Optimization Technique for Protocol Conformance Test Generation Based on UIO Sequences and Rural Chinese Postman Tours. Proceedings of Protocol Specification, Testing, and Verification VHL Atlantic City NJ. North-Holland Publishers, pp. 75-86.
    • (1988) Proceedings of Protocol Specification, Testing, and Verification , pp. 75-86
    • Aho, A.V.1    Dahbura, A.T.2    Lee, D.3    Uyar, M.U.4
  • 4
    • 0002703887 scopus 로고
    • Gedanken-Experiments
    • Shannon, C. and Carthy, J. M. (eds), Princeton University Press, Princeton, NJ
    • Moore, E. P. (1956) Gedanken-Experiments, In Shannon, C. and Carthy, J. M. (eds), Automata Studies. Princeton University Press, Princeton, NJ, pp. 129-153.
    • (1956) Automata Studies , pp. 129-153
    • Moore, E.P.1
  • 5
    • 0000973916 scopus 로고
    • Finite Automata and Their Decision Problems
    • Rabin, M. O. and Scott, D. (1959) Finite Automata and Their Decision Problems, IBM J. Res. Dev., 3(2), 114-125.
    • (1959) IBM J. Res. Dev. , vol.3 , Issue.2 , pp. 114-125
    • Rabin, M.O.1    Scott, D.2
  • 8
    • 0024650136 scopus 로고
    • Formal Methods in Protocol Testing: A Detailed Study
    • Sidhu, D. P. and Leung, T. K. (1989) Formal Methods in Protocol Testing: A Detailed Study. IEEE Trans. Software Engng, 15(4), 413-426.
    • (1989) IEEE Trans. Software Engng , vol.15 , Issue.4 , pp. 413-426
    • Sidhu, D.P.1    Leung, T.K.2
  • 9
    • 3743088425 scopus 로고
    • An Improved RCP-Method for Protocol Test Generation Using Backward UIO Sequences
    • Kansas City, KS
    • Shen, X., Scoggins, S. and Tang, A. (1991) An Improved RCP-Method for Protocol Test Generation Using Backward UIO Sequences. Proceedings of the ACM Symposium on Applied Computing, Kansas City, KS, pp. 284-193.
    • (1991) Proceedings of the ACM Symposium on Applied Computing , pp. 284-1193
    • Shen, X.1    Scoggins, S.2    Tang, A.3
  • 11
    • 0017973244 scopus 로고
    • Testing Software Design Modelled by Finite State Machines
    • Chow, T. S. (1978) Testing Software Design Modelled by Finite State Machines. IEEE Trans. Software Engng, 4, 178-187.
    • (1978) IEEE Trans. Software Engng , vol.4 , pp. 178-187
    • Chow, T.S.1
  • 12
    • 3743118505 scopus 로고
    • Protocol Conformance Testing Using Multiple UIO Sequences
    • Twente, Netherlands, September 24-27. North Holland, Netherlands
    • Shen, Y. N. Lombardi, F. and Dahbura, A. T. (1990) Protocol Conformance Testing Using Multiple UIO Sequences. Proceedings of Protocol Specification, Testing, and Verification IX. Twente, Netherlands, September 24-27. North Holland, Netherlands, pp. 131-143.
    • (1990) Proceedings of Protocol Specification, Testing, and Verification IX , pp. 131-143
    • Shen, Y.N.1    Lombardi, F.2    Dahbura, A.T.3
  • 14
    • 85025285224 scopus 로고
    • Protocol Conformance Test Generation Using Multiple UIO Sequences with Overlapping
    • Twente, Netherlands, September 24-27. North Holland, Netherlands
    • Yang, B. and Ural, H. (1990) Protocol Conformance Test Generation Using Multiple UIO Sequences with Overlapping. ACM SIGCOMM 90: Communications, Architectures, and Protocols Twente, Netherlands, September 24-27. North Holland, Netherlands, pp. 118-125.
    • (1990) ACM SIGCOMM 90: Communications, Architectures, and Protocols , pp. 118-125
    • Yang, B.1    Ural, H.2
  • 15
    • 0002293349 scopus 로고
    • Matchings, Euler Tours, and the Chinese Postman Problem
    • Edmonds, J. and Johnson, E. L. (1973) Matchings, Euler Tours, and the Chinese Postman Problem. Mathematical Programming, 5, 88-124.
    • (1973) Mathematical Programming , vol.5 , pp. 88-124
    • Edmonds, J.1    Johnson, E.L.2
  • 16
    • 0015330635 scopus 로고
    • Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
    • Edmonds, J. and Karp, R. M. (1972) Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. Journal of the ACM, 19(2), 248-264.
    • (1972) Journal of the ACM , vol.19 , Issue.2 , pp. 248-264
    • Edmonds, J.1    Karp, R.M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.