메뉴 건너뛰기




Volumn 2001-January, Issue , 2001, Pages 304-311

A measure for component interaction test coverage

Author keywords

interactions; Software engineering; system testing; test coverage

Indexed keywords

BEAM PLASMA INTERACTIONS; ECONOMIC AND SOCIAL EFFECTS; SOFTWARE DESIGN; SOFTWARE ENGINEERING; TESTING;

EID: 84928673435     PISSN: 21615322     EISSN: 21615330     Source Type: Conference Proceeding    
DOI: 10.1109/AICCSA.2001.934001     Document Type: Conference Paper
Times cited : (80)

References (16)
  • 1
    • 0004097670 scopus 로고
    • Second Edition, Van Nostrand Reinhold, New York NY USA
    • Beizer, B. Software Testing Techniques, Second Edition, Van Nostrand Reinhold, New York NY USA, 1990.
    • (1990) Software Testing Techniques
    • Beizer, B.1
  • 2
    • 84977307274 scopus 로고
    • Robust Testing of AT&T PMX/StarMail using OATS
    • May/June
    • Brownlie, R., Prowse, J., and Phadke, M.S. Robust Testing of AT&T PMX/StarMail using OATS. AT&T Technical Journal 71, 3 (May/June 1992), 41-47.
    • (1992) AT&T Technical Journal , vol.71 , Issue.3 , pp. 41-47
    • Brownlie, R.1    Prowse, J.2    Phadke, M.S.3
  • 3
    • 0027929875 scopus 로고
    • Improved Quality of Protocol Testing Through Techniques of Experimental Design
    • Burroughs, K., Jain, A., and Erickson, R.L. Improved Quality of Protocol Testing Through Techniques of Experimental Design. In Proceedings of Supercomm/ICC '94, (1994), 745-752.
    • (1994) Proceedings of Supercomm/ICC '94 , pp. 745-752
    • Burroughs, K.1    Jain, A.2    Erickson, R.L.3
  • 5
    • 0030242266 scopus 로고    scopus 로고
    • The Combinatorial Approach to Automatic Test Generation
    • Sept.
    • Cohen, D.M., Dalal, S.R., Parelius, J., and Patton, G.C. The Combinatorial Approach to Automatic Test Generation. IEEE Software 13, 5 (Sept. 1996), 83-88.
    • (1996) IEEE Software , vol.13 , Issue.5 , pp. 83-88
    • Cohen, D.M.1    Dalal, S.R.2    Parelius, J.3    Patton, G.C.4
  • 8
    • 84957649710 scopus 로고    scopus 로고
    • Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems
    • Proceedings of the 1st Symposium on Randomization and Approximation Techniques in Computer Science, Springer-Verlag
    • Karpinski, M. Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems. In Proceedings of the 1st Symposium on Randomization and Approximation Techniques in Computer Science, Lecture Notes in Computer Science 1269, Springer-Verlag, 1997, 1-14.
    • (1997) Lecture Notes in Computer Science , vol.1269 , pp. 1-14
    • Karpinski, M.1
  • 9
    • 0346717704 scopus 로고    scopus 로고
    • Approximating Dense Cases of Covering Problems
    • Karpinski, M. and Zelikovsky, A. Approximating Dense Cases of Covering Problems. ECCC Technical Report TR97-004. On-line at ftp://eccc.uni-trier.de/pub/eccc/reports/1997/TR97-004/index.html.
    • ECCC Technical Report
    • Karpinski, M.1    Zelikovsky, A.2
  • 11
    • 84941181463 scopus 로고
    • Operational profiles in software reliability engineering
    • March
    • Musa, J.D. Operational profiles in software reliability engineering. IEEE Software 10, 2 (March 1993), 14-32.
    • (1993) IEEE Software , vol.10 , Issue.2 , pp. 14-32
    • Musa, J.D.1
  • 12
    • 84954127185 scopus 로고
    • A Methodology for Designing and Executing ISDN Feature Tests Using Automated Test Systems
    • Perkinson, W.B. A Methodology for Designing and Executing ISDN Feature Tests Using Automated Test Systems. In Proc. of IEEE GLOBECOMM '92, (1992).
    • (1992) Proc. of IEEE GLOBECOMM '92
    • Perkinson, W.B.1


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