메뉴 건너뛰기




Volumn 3440, Issue , 2005, Pages 108-123

A generic theorem prover of CSP refinement

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER ARCHITECTURE; ENCODING (SYMBOLS); FINITE AUTOMATA; INTERACTIVE COMPUTER SYSTEMS; SEMANTICS; STATE SPACE METHODS;

EID: 24644442880     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31980-1_8     Document Type: Conference Paper
Times cited : (34)

References (26)
  • 1
    • 84948958953 scopus 로고    scopus 로고
    • Process algebra in PVS
    • W. Cleaveland, editor, LNCS 1579. Springer
    • T. Basten and J. Hooman. Process algebra in PVS. In W. Cleaveland, editor, TACAS'99, LNCS 1579, pages 270-284. Springer, 1999.
    • (1999) TACAS'99 , pp. 270-284
    • Basten, T.1    Hooman, J.2
  • 3
    • 84947927343 scopus 로고    scopus 로고
    • Deadlock analysis for a fault-tolerant system
    • LNCS 1349. Springer
    • B. Buth, M. Kouvaras, J. Peleska, and H. Shi. Deadlock analysis for a fault-tolerant system. In AMAST'97, LNCS 1349, pages 60-75. Springer, 1997.
    • (1997) AMAST'97 , pp. 60-75
    • Buth, B.1    Kouvaras, M.2    Peleska, J.3    Shi, H.4
  • 4
    • 84958952470 scopus 로고    scopus 로고
    • Combining methods for the livelock analysis of a fault-tolerant system
    • A. M. Haeberer, editor, LNCS 1548. Springer
    • B. Buth, J. Peleska, and H. Shi. Combining methods for the livelock analysis of a fault-tolerant system. In A. M. Haeberer, editor, AMAST'98, LNCS 1548, pages 124-139. Springer, 1998.
    • (1998) AMAST'98 , pp. 124-139
    • Buth, B.1    Peleska, J.2    Shi, H.3
  • 5
    • 24644475211 scopus 로고    scopus 로고
    • Model-checking the architectural design of a fail-safe communication system for railway interlocking systems
    • J. M. Wing, J. Woodcock, and J. Davies, editors, LNCS 1709. Springer
    • B. Buth and M. Schrönen. Model-checking the architectural design of a fail-safe communication system for railway interlocking systems. In J. M. Wing, J. Woodcock, and J. Davies, editors, FM'99, LNCS 1709. Springer, 1999.
    • (1999) FM'99
    • Buth, B.1    Schrönen, M.2
  • 6
    • 85030666987 scopus 로고
    • Combining interaction and automation in process algebra verification
    • G. Goos and J. Hartmanis, editors, LNCS 494. Springer
    • A. Camilleri. Combining interaction and automation in process algebra verification. In G. Goos and J. Hartmanis, editors, TAPSOFT 1991, LNCS 494, pages 283-295. Springer, 1991.
    • (1991) TAPSOFT 1991 , pp. 283-295
    • Camilleri, A.1
  • 8
    • 84949641590 scopus 로고    scopus 로고
    • Using a PVS embedding of CSP to verify authentication protocols
    • E. L. Gunter and A. Felty, editors, LNCS 1275. Springer
    • B. Dutertre and S. Schneider. Using a PVS embedding of CSP to verify authentication protocols. In E. L. Gunter and A. Felty, editors, TPHOL 1997, LNCS 1275, pages 121-136. Springer, 1997.
    • (1997) TPHOL 1997 , pp. 121-136
    • Dutertre, B.1    Schneider, S.2
  • 9
    • 24644478577 scopus 로고    scopus 로고
    • Towards a formal specification of an electronic payment system in CsP-CASL
    • J. L. Fiadeiro, P. Mosses, and F. Orejas, editors, LNCS. Springer, to appear
    • A. Gimblett, M. Roggenbach, and H. Schlingloff. Towards a formal specification of an electronic payment system in CsP-CASL. In J. L. Fiadeiro, P. Mosses, and F. Orejas, editors, WADT 2004, LNCS. Springer, to appear.
    • WADT 2004
    • Gimblett, A.1    Roggenbach, M.2    Schlingloff, H.3
  • 13
    • 0002747273 scopus 로고
    • The 3x+1 problem and its generalizations
    • J. C. Lagarias. The 3x+1 problem and its generalizations. Amer. Math. Monthly, 92:3-23, 1985.
    • (1985) Amer. Math. Monthly , vol.92 , pp. 3-23
    • Lagarias, J.C.1
  • 17
    • 84944677742 scopus 로고
    • PVS: A prototype verification system
    • D. Kapur, editor, LNAI 607. Springer
    • S. Owre, J. M. Rushby, and N. Shankar. PVS: A prototype verification system. In D. Kapur, editor, CADE'92, LNAI 607, pages 748-752. Springer, 1992.
    • (1992) CADE'92 , pp. 748-752
    • Owre, S.1    Rushby, J.M.2    Shankar, N.3
  • 19
    • 69249246820 scopus 로고
    • Algebraic proof assistants in HOL
    • B. Möller, editor, LNCS 947. Springer
    • I. P. Rix Groenboom, Chris Hendriks. Algebraic proof assistants in HOL. In B. Möller, editor, MPC'95, LNCS 947, pages 305-321. Springer, 1995.
    • (1995) MPC'95 , pp. 305-321
    • Groenboom, I.P.R.1    Hendriks, C.2
  • 20
    • 33644584169 scopus 로고    scopus 로고
    • CSP-CASL - A new integration of process algebra and algebraic specification
    • to appear
    • M. Roggenbach. CSP-CASL - A new integration of process algebra and algebraic specification. Theoretical Computer Science, to appear.
    • Theoretical Computer Science
    • Roggenbach, M.1
  • 22
    • 30344469196 scopus 로고    scopus 로고
    • On the expressive power of CSP refinement
    • Technical Report. Southampton University
    • A. Roscoe. On the expressive power of CSP refinement. In Proceedings of AVoCS'03, Technical Report. Southampton University, 2003.
    • (2003) Proceedings of AVoCS'03
    • Roscoe, A.1
  • 24
    • 24644523336 scopus 로고    scopus 로고
    • Verifying authentication protocol implementations
    • B. Jacobs and A. Rensink, editors, Kluwer
    • S. Schneider. Verifying authentication protocol implementations. In B. Jacobs and A. Rensink, editors, FMOODS 2002, IFIP Conference Proceedings Vol. 209, pages 5-24. Kluwer, 2002.
    • (2002) FMOODS 2002, IFIP Conference Proceedings , vol.209 , pp. 5-24
    • Schneider, S.1
  • 26
    • 84957358115 scopus 로고    scopus 로고
    • A corrected failure-divergence model for CSP in Isabelle/HOL
    • J. Fitzgerald, C. B. Jones, and P. Lucas, editors, LNCS 1313. Springer
    • H. Tej and B. Wolff. A corrected failure-divergence model for CSP in Isabelle/HOL. In J. Fitzgerald, C. B. Jones, and P. Lucas, editors, FME'97, LNCS 1313, pages 318-337. Springer, 1997.
    • (1997) FME'97 , pp. 318-337
    • Tej, H.1    Wolff, B.2


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