메뉴 건너뛰기




Volumn 1641, Issue , 1999, Pages 228-242

A symbolic model checker for ACTL

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL METHODS; PROGRAM INTERPRETERS; PROGRAM TRANSLATORS; SEMANTICS;

EID: 84957672842     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48257-1_14     Document Type: Conference Paper
Times cited : (14)

References (28)
  • 4
    • 0001152506 scopus 로고
    • The integration Project for the JACK Environment
    • A. Bouali, S. Gnesi, S. Larosa. The integration Project for the JACK Environment, Bulletin of the EATCS, n.54, pp.207-223, 1994. (see also http://repl.iei.pi.cnr.it/projects/JACK.)
    • (1994) Bulletin of the EATCS , Issue.54 , pp. 207-223
    • Bouali, A.1    Gnesi, S.2    Larosa, S.3
  • 6
    • 0022769976 scopus 로고
    • Graph Based algorithms for boolean function manipulation
    • R.E. Bryant. Graph Based algorithms for boolean function manipulation, IEEE Transaction on Computers, C-35(8), 1986.
    • (1986) IEEE Transaction on Computers , vol.C-35 , Issue.8
    • Bryant, R.E.1
  • 8
  • 11
    • 0027542040 scopus 로고
    • An action-based framework for verifying logical and behavioural properties of concurrent systems
    • R. De Nicola, A. Fantechi, S. Gnesi, G. Ristori. An action-based framework for verifying logical and behavioural properties of concurrent systems, Computer Networks and ISDN Systems, 25(7):761-778, 1993.
    • (1993) Computer Networks and ISDN Systems , vol.25 , Issue.7 , pp. 761-778
    • Nicola, D.R.1    Fantechi, A.2    Gnesi, S.3    Ristori, G.4
  • 14
    • 0022514018 scopus 로고
    • "Sometime" and "Not never" revisited: On branching versus linear time temporal logic
    • E.A. Emerson, J. Halpem. "Sometime" and "Not never" revisited: On branching versus linear time temporal logic, JA CM 33:151-178, 1986.
    • (1986) JA CM , vol.33 , pp. 151-178
    • Emerson, E.A.1    Halpem, J.2
  • 15
    • 0022956502 scopus 로고
    • Efficient Model Checking in Fragments of the Propositional Mu-Calculus
    • E.A. Emerson, C. Lei. Efficient Model Checking in Fragments of the Propositional Mu-Calculus, in Proceedings of LICS, pp. 267-278, 1986.
    • (1986) Proceedings of LICS , pp. 267-278
    • Emerson, E.A.1    Lei, C.2
  • 19
    • 0021974161 scopus 로고
    • Algebraic Laws for Nondeterminism and Concurrency
    • M. Hennessy, R. Milner. Algebraic Laws for Nondeterminism and Concurrency, JACM 32:137-161, 1985.
    • (1985) JACM , vol.32 , pp. 137-161
    • Hennessy, M.1    Milner, R.2
  • 20
    • 49049126479 scopus 로고
    • Results on the Propositional μ-calculus
    • D. Kozen. Results on the Propositional μ-calculus, Theoretical Computer Science, 27:333-354, 1983.
    • (1983) Theoretical Computer Science , vol.27 , pp. 333-354
    • Kozen, D.1
  • 22
  • 23
    • 0003931061 scopus 로고
    • Technical Report DAIMI FN-19, Aarhus University, Dep. of Computer Science, Denmark
    • G.D. Plotkin. A Structural Approach to Operational Semantics, Technical Report DAIMI FN-19, Aarhus University, Dep. of Computer Science, Denmark, 1981.
    • (1981) A Structural Approach to Operational Semantics
    • Plotkin, G.D.1
  • 27
    • 0029180056 scopus 로고
    • Hardware Verification, Boolean Logic Programming, Boolean Functional Programming
    • E. Tronci. Hardware Verification, Boolean Logic Programming, Boolean Functional Programming, in Proceedings of LICS, 1995.
    • (1995) Proceedings of LICS
    • Tronci, E.1


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