메뉴 건너뛰기




Volumn , Issue , 2008, Pages 131-132

Test sequence computation for regression testing of reactive systems

Author keywords

API; NP complete; Regression testing; Test sequence; Test specification

Indexed keywords

API; NP-COMPLETE; REGRESSION TESTING; TEST SEQUENCE; TEST SPECIFICATION;

EID: 70249147657     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1342211.1342238     Document Type: Conference Paper
Times cited : (2)

References (7)
  • 1
    • 70249104191 scopus 로고    scopus 로고
    • Test Sequence Computation for Regression Testing of Reactive Systems, http://archive.csa.iisc.ernet.in/tr/ 2007/7/
    • Technical report
    • S. K. Chakrabarti and Y. N. Srikant. Test Sequence Computation for Regression Testing of Reactive Systems, http://archive.csa.iisc.ernet.in/tr/ 2007/7/. Technical report.
    • Chakrabarti, S.K.1    Srikant, Y.N.2
  • 2
    • 38849130673 scopus 로고    scopus 로고
    • Specification Based Regression Testing using Explicit State Space Enumeration
    • IARIA, October
    • S. K. Chakrabarti and Y. N. Srikant. Specification Based Regression Testing using Explicit State Space Enumeration. In ICSEA'06. IARIA, October 2006.
    • (2006) ICSEA'06
    • Chakrabarti, S.K.1    Srikant, Y.N.2
  • 3
    • 85002263369 scopus 로고    scopus 로고
    • C. Cook, D. A. Schoenefeld, and R. L. Wainwright. Finding Rural Postman Tours. In SAC'98, pages 318{326. ACM Press, 1998.
    • C. Cook, D. A. Schoenefeld, and R. L. Wainwright. Finding Rural Postman Tours. In SAC'98, pages 318{326. ACM Press, 1998.
  • 4
    • 85002235370 scopus 로고    scopus 로고
    • M.-J. Kang and C.-G. Han. Solving the Rural Postman Problem using a Genetic Algorithm with a Graph Transformation. In SAC'98, pages 356{360. ACM Press, 1998.
    • M.-J. Kang and C.-G. Han. Solving the Rural Postman Problem using a Genetic Algorithm with a Graph Transformation. In SAC'98, pages 356{360. ACM Press, 1998.
  • 5
    • 84981584138 scopus 로고    scopus 로고
    • K. Lenstra, J and A. H. G. Rinnooy Kan. On General Routing Problems. Networks 6, pages 273{280, 1976.
    • K. Lenstra, J and A. H. G. Rinnooy Kan. On General Routing Problems. Networks 6, pages 273{280, 1976.
  • 6
    • 0032643001 scopus 로고    scopus 로고
    • A. M. Memon, M. E. Pollack, and M. L. Soffa. Using a Goal-Driven Approach to Generate Test Cases for GUIs. In ICSE'99, pages 257{266. IEEE Computer Society Press, 1999.
    • A. M. Memon, M. E. Pollack, and M. L. Soffa. Using a Goal-Driven Approach to Generate Test Cases for GUIs. In ICSE'99, pages 257{266. IEEE Computer Society Press, 1999.
  • 7
    • 0027612518 scopus 로고    scopus 로고
    • H. Ural and K. Zhu. Optimal Length Test Sequence Generation using Distinguishing Sequences. IEEE/ACM Transactions on Networking (TON), 1(3):358{371, 1993.
    • H. Ural and K. Zhu. Optimal Length Test Sequence Generation using Distinguishing Sequences. IEEE/ACM Transactions on Networking (TON), 1(3):358{371, 1993.


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