메뉴 건너뛰기




Volumn 4218 LNCS, Issue , 2006, Pages 399-414

A semantic framework for test coverage

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTER VIRUSES; METRIC SYSTEM; OPTIMIZATION; SEMANTICS; SYNTACTICS;

EID: 33845193764     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper
Times cited : (14)

References (17)
  • 1
    • 26444530236 scopus 로고    scopus 로고
    • A theory of predicate-complete test coverage and generation
    • BALL, T. A theory of predicate-complete test coverage and generation. In Proceedings of FMCO'04 (2004), pp. 1-22.
    • (2004) Proceedings of FMCO'04 , pp. 1-22
    • Ball, T.1
  • 4
    • 24144458245 scopus 로고    scopus 로고
    • A test generation framework for quiescent real-time systems
    • BRANDÁN BRIONES, L., AND BRINKSMA, E. A test generation framework for quiescent real-time systems. In FATES'04 (2004), pp. 64-78.
    • (2004) FATES'04 , pp. 64-78
    • Brandán Briones, L.1    Brinksma, E.2
  • 8
    • 23944432682 scopus 로고    scopus 로고
    • TGV: Theory, principles and algorithms
    • JARD, C., AND JÉRON, T. TGV: theory, principles and algorithms. STTT 7, 4 (2005), 297-315.
    • (2005) STTT , vol.7 , Issue.4 , pp. 297-315
    • Jard, C.1    Jéron, T.2
  • 9
    • 0030212784 scopus 로고    scopus 로고
    • Principles and methods of testing finite state machines - A survey
    • LEE, D., AND YANNAKAKIS, M. Principles and methods of testing finite state machines - A survey. In Proceedings of the IEEE (1996), vol. 84, pp. 1090-1126.
    • (1996) Proceedings of the IEEE , vol.84 , pp. 1090-1126
    • Lee, D.1    Yannakakis, M.2
  • 13
    • 0020995930 scopus 로고
    • Testing equivalences for processes
    • NICOLA, R., AND HENNESSY, M. Testing equivalences for processes. In Proceedings ICALP (1983), vol. 154.
    • (1983) Proceedings ICALP , vol.154
    • Nicola, R.1    Hennessy, M.2
  • 14
    • 51249170715 scopus 로고
    • A strongly polynomial minimum cost circulation algorithm
    • TARDOS, E. A strongly polynomial minimum cost circulation algorithm. Combinatorica 5, 3 (1985), 247-255.
    • (1985) Combinatorica , vol.5 , Issue.3 , pp. 247-255
    • Tardos, E.1
  • 15
    • 0000101791 scopus 로고    scopus 로고
    • Test generation with inputs, outputs and repetitive quiescence
    • TRETMANS, J. Test generation with inputs, outputs and repetitive quiescence. Software-Concepts and Tools 17, 3 (1996), 103-120.
    • (1996) Software-concepts and Tools , vol.17 , Issue.3 , pp. 103-120
    • Tretmans, J.1
  • 17
    • 38249013041 scopus 로고
    • Formal methods for test sequence generation
    • URAL, H. Formal methods for test sequence generation. Computer Communications Journal 15, 5 (1992), 311-325.
    • (1992) Computer Communications Journal , vol.15 , Issue.5 , pp. 311-325
    • Ural, H.1


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