메뉴 건너뛰기




Volumn , Issue , 2007, Pages 75-84

Relating counterexamples to test cases in CTL model checking specifications

Author keywords

Counterexamples; Formal methods; Model checking; Software testing; State machines; Test coverage criteria

Indexed keywords

FORMAL METHODS; SOFTWARE TESTING; TREES (MATHEMATICS);

EID: 38849135422     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1291535.1291543     Document Type: Conference Paper
Times cited : (12)

References (22)
  • 3
    • 85178861217 scopus 로고    scopus 로고
    • P. Ammann, W. Ding, and D. Xu. Using a Model Checker to Test Safety Properties. In Proceedings of the 7th International Conference on Engineering of Complex Computer Systems (ICECCS 2001), pages 212-221, Skovde, Sweden, 2001. IEEE.
    • P. Ammann, W. Ding, and D. Xu. Using a Model Checker to Test Safety Properties. In Proceedings of the 7th International Conference on Engineering of Complex Computer Systems (ICECCS 2001), pages 212-221, Skovde, Sweden, 2001. IEEE.
  • 5
    • 38849122351 scopus 로고    scopus 로고
    • J. Callahan, F. Schneider, and S. Easterbrook. Automated Software Testing Using Model-Checking. In Proceedings 1996 SPIN Workshop, August 1996. Also WVU Technical Report NASA-IVV-96-022.
    • J. Callahan, F. Schneider, and S. Easterbrook. Automated Software Testing Using Model-Checking. In Proceedings 1996 SPIN Workshop, August 1996. Also WVU Technical Report NASA-IVV-96-022.
  • 6
    • 0028497822 scopus 로고
    • Applicability of modified condition/decision coverage to software testing
    • September
    • J. J. Chilenski and S. P. Miller. Applicability of modified condition/decision coverage to software testing. Software Engineering Journal, pages 193-200, September 1994.
    • (1994) Software Engineering Journal , pp. 193-200
    • Chilenski, J.J.1    Miller, S.P.2
  • 7
    • 35248890016 scopus 로고    scopus 로고
    • Counterexamples revisited: Principles, algorithms, applications
    • Verification: Theory and Practice, of
    • E. Clarke and H. Veith. Counterexamples revisited: Principles, algorithms, applications. In Verification: Theory and Practice, volume 2772 of Lecture Notes in Computer Science, pages 208-224, 2004.
    • (2004) Lecture Notes in Computer Science , vol.2772 , pp. 208-224
    • Clarke, E.1    Veith, H.2
  • 8
    • 85037030721 scopus 로고
    • Design and synthesis of synchronization skeletons using branching-time temporal logic
    • London, UK, Springer-Verlag
    • E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Logic of Programs, Workshop, pages 52-71, London, UK, 1982. Springer-Verlag.
    • (1982) Logic of Programs, Workshop , pp. 52-71
    • Clarke, E.M.1    Emerson, E.A.2
  • 13
    • 84958769296 scopus 로고    scopus 로고
    • Test generation for intelligent networks using model checking
    • E. Brinksma, editor, Proceedings of the Third International Workshop on Tools and Algorithms for the Construction and Analysis of Systems, TACAS'97, of, Enschede, the Netherlands, April, Springer-Verlag
    • A. Engels, L. Feijs, and S. Mauw. Test generation for intelligent networks using model checking. In E. Brinksma, editor, Proceedings of the Third International Workshop on Tools and Algorithms for the Construction and Analysis of Systems. (TACAS'97), volume 1217 of Lecture Notes in Computer Science, Enschede, the Netherlands, April 1997. Springer-Verlag.
    • (1997) Lecture Notes in Computer Science , vol.1217
    • Engels, A.1    Feijs, L.2    Mauw, S.3
  • 15
    • 0010314258 scopus 로고
    • The SMV system
    • Technical Report CMU-CS-92-131, Carnegie-Mellon University
    • K.L. McMillan. The SMV system. Technical Report CMU-CS-92-131, Carnegie-Mellon University, 1992.
    • (1992)
    • McMillan, K.L.1
  • 17
    • 35048856013 scopus 로고    scopus 로고
    • Witness and counterexample automata for actl
    • Formal Techniques for Networked and Distributed Systems FORTE 2004, of
    • R., Meolic, A. Fantechi, and S. Gnesi. Witness and counterexample automata for actl. In Formal Techniques for Networked and Distributed Systems FORTE 2004, volume 3235 of Lecture Notes in Computer Science, pages 259-275, 2004.
    • (2004) Lecture Notes in Computer Science , vol.3235 , pp. 259-275
    • Meolic, R.1    Fantechi, A.2    Gnesi, S.3


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