메뉴 건너뛰기




Volumn 13, Issue 5, 2007, Pages 639-649

Model checking: Software and beyond

Author keywords

Formal methods; Model checking

Indexed keywords


EID: 34547282625     PISSN: 0958695X     EISSN: 09486968     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (24)

References (40)
  • 2
    • 0028413052 scopus 로고
    • Dill. A Theory of Timed Automata
    • April
    • Rajeev Alur and. David L. Dill. A Theory of Timed Automata. Theoretical Computer Science, 126(2):183-235, April 1994.
    • (1994) Theoretical Computer Science , vol.126 , Issue.2 , pp. 183-235
    • Alur, R.1    David, L.2
  • 4
    • 0020880468 scopus 로고
    • The Temporal Logic of Branching Time
    • Mordechai Ben-Ari, Amir Pnueli, and. Zohar Manna. The Temporal Logic of Branching Time. Acta Informatica, 20:207-226, 1983.
    • (1983) Acta Informatica , vol.20 , pp. 207-226
    • Ben-Ari, M.1    Pnueli, A.2    Manna, Z.3
  • 7
    • 0022769976 scopus 로고
    • Graph-Based Algorithms for Boolean Function Manipulation
    • Randal E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, 35(8):667-691, 1986.
    • (1986) IEEE Transactions on Computers , vol.35 , Issue.8 , pp. 667-691
    • Bryant, R.E.1
  • 9
    • 0038601527 scopus 로고    scopus 로고
    • Sagar Chaki, Edmund M. Clarke, Alex Groce, Somesh Jha, and Helmut Veith. Modular Verification of Software Components in C. In Proc. of the 25th International Conference on Software Engineering, 2003.
    • Sagar Chaki, Edmund M. Clarke, Alex Groce, Somesh Jha, and Helmut Veith. Modular Verification of Software Components in C. In Proc. of the 25th International Conference on Software Engineering, 2003.
  • 11
    • 70749155027 scopus 로고    scopus 로고
    • The Birth of Model Checking
    • Technical Report CMU-CS-TR-110, Carnegie Mellon University
    • Edmund M. Clarke. The Birth of Model Checking. Technical Report CMU-CS-TR-110, Carnegie Mellon University, 2007.
    • (2007)
    • Clarke, E.M.1
  • 18
    • 0000289556 scopus 로고    scopus 로고
    • Formal Methods: State of the Art and Future Directions
    • Edmund M. Clarke and Jeannette M. Wing. Formal Methods: State of the Art and Future Directions. ACM Computing Surveys, 28(4):626-643, 1996.
    • (1996) ACM Computing Surveys , vol.28 , Issue.4 , pp. 626-643
    • Clarke, E.M.1    Wing, J.M.2
  • 20
    • 84881072062 scopus 로고
    • A Computing Procedure for Quantification Theory
    • Martin Davis and Hilary Putnam. A Computing Procedure for Quantification Theory. Journal of the ACM, 7(3):201-215, 1960.
    • (1960) Journal of the ACM , vol.7 , Issue.3 , pp. 201-215
    • Davis, M.1    Putnam, H.2
  • 21
    • 0022514018 scopus 로고
    • Sometimes" and "Not Never" Revisited: On Branching versus Linear Time Temporal Logic
    • E. Allen Emerson and Joseph Y Halpern. "Sometimes" and "Not Never" Revisited: On Branching versus Linear Time Temporal Logic. Journal of the ACM, 33(1):151-178, 1986.
    • (1986) Journal of the ACM , vol.33 , Issue.1 , pp. 151-178
    • Allen Emerson, E.1    Halpern, J.Y.2
  • 30
    • 0034852165 scopus 로고    scopus 로고
    • Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad. Malik. Chaff: Engineering an Efficient SAT Solver
    • Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad. Malik. Chaff: Engineering an Efficient SAT Solver. In Proc. of the 38th Design Automation Conference, 2001.
    • (2001) Proc. of the 38th Design Automation Conference
    • Matthew, W.1
  • 32
    • 49149133038 scopus 로고
    • The Temporal Semantics of Concurrent Programs
    • Amir Pnueli. The Temporal Semantics of Concurrent Programs. Theoretical Computer Science, 13:45-60, 1981.
    • (1981) Theoretical Computer Science , vol.13 , pp. 45-60
    • Pnueli, A.1


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