메뉴 건너뛰기




Volumn 1254, Issue , 1997, Pages 232-243

On-the-fly model checking under fairness that exploits symmetry

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS;

EID: 84947439379     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63166-6_24     Document Type: Conference Paper
Times cited : (28)

References (10)
  • 3
    • 3242657638 scopus 로고
    • Automatic Verification of Finite State Concurrent Programs. Using Temporal Logic: A Practical Approach
    • January 1983, Austin, Texas, Also appeared in ACM TOPLAS
    • Clarke, E. M., Emerson, E. A., Sistla, A. P.: Automatic Verification of Finite State Concurrent Programs. using Temporal Logic: A Practical Approach, Proceedings of the ACM Symposium on Principles of Programming Languages, January 1983, Austin, Texas, Also appeared in ACM TOPLAS, April 1986
    • (1986) Proceedings of the ACM Symposium on Principles of Programming Languages
    • Clarke, E.M.1    Emerson, E.A.2    Sistla, A.P.3
  • 6
    • 48949096111 scopus 로고
    • Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata-theoretic Approach
    • Leige, Belgium
    • Emerson, E. A., Sistla, A. P.: Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata-theoretic Approach. 7th International Conference on Computer Aided Verification, Leige, Belgium, July 1995
    • (1995) 7Th International Conference on Computer Aided Verification
    • Emerson, E.A.1    Sistla, A.P.2
  • 7
    • 0003257889 scopus 로고    scopus 로고
    • Partial-Order Methods for the Verification of Concurrent Systems
    • Springer
    • Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems. Lecture Notes in Computer Science 1032 Springer, 1996
    • (1996) Lecture Notes in Computer Science , vol.1032
    • Godefroid, P.1


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