메뉴 건너뛰기




Volumn 418, Issue , 2008, Pages 17-37

A TLA+ proof system

Author keywords

[No Author keywords available]

Indexed keywords

AXIOMATI-SATION; INCREMENTAL DEVELOPMENT; ISABELLE; PROOF OBLIGATIONS; PROOF SYSTEM;

EID: 84865307442     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (11)

References (17)
  • 2
    • 38149090186 scopus 로고    scopus 로고
    • Zenon: An extensible automated theorem prover producing checkable proofs
    • N. Dershowitz and A. Voronkov, editors
    • Richard Bonichon, David Delahaye, and Damien Doligez. Zenon: An extensible automated theorem prover producing checkable proofs. In N. Dershowitz and A. Voronkov, editors, Proc. 14th LPAR, pages 151-165, 2007.
    • (2007) Proc. 14th LPAR , pp. 151-165
    • Bonichon, R.1    Delahaye, D.2    Doligez, D.3
  • 4
    • 84957709018 scopus 로고
    • Mechanical verification of concurrent systems with TLA
    • G. v. Bochmann and D. K. Probst, editors Springer-Verlag, June
    • Urban Engberg, Peter Grønning, and Leslie Lamport. Mechanical verification of concurrent systems with TLA. In G. v. Bochmann and D. K. Probst, editors, Proc. 4th CAV, Volume 663 of Lecture Notes in Computer Science, pages 44-55. Springer-Verlag, June 1992.
    • (1992) Proc. 4th CAV, Volume 663 of Lecture Notes in Computer Science , pp. 44-55
    • Engberg, U.1    Grønning, P.2    Lamport, L.3
  • 5
    • 33745791973 scopus 로고    scopus 로고
    • Expressiveness + automation + soundness: Towards combining SMT solvers and interactive proof assistants
    • Holger Hermanns and Jens Palsberg, editors Vienna, Austria Springer Verlag
    • Pascal Fontaine, Jean-Yves Marion, Stephan Merz, Leonor Prensa Nieto, and Alwen Tiu. Expressiveness + automation + soundness: Towards combining SMT solvers and interactive proof assistants. In Holger Hermanns and Jens Palsberg, editors, Proc. 12th TACAS, Volume 3920 of Lecture Notes in Computer Science, pages 167-181, Vienna, Austria, 2006. Springer Verlag.
    • (2006) Proc. 12th TACAS, Volume 3920 of Lecture Notes in Computer Science , pp. 167-181
    • Fontaine, P.1    Marion, J.-Y.2    Merz, S.3    Nieto, L.P.4    Tiu, A.5
  • 9
    • 0012652644 scopus 로고
    • How to write a proof
    • August
    • Leslie Lamport. How to write a proof. American Mathematical Monthly, 102(7):600-608, August 1993.
    • (1993) American Mathematical Monthly , vol.102 , Issue.7 , pp. 600-608
    • Lamport, L.1
  • 12
    • 84885650972 scopus 로고    scopus 로고
    • Draft manuscript, April
    • +2: A preliminary guide. Draft manuscript, April 2008. http://research.microsoft.com/users/lamport/tla/tla2-guide.pdf.
    • (2008) +2: A Preliminary Guide
    • Lamport, L.1
  • 15
    • 15544372418 scopus 로고
    • An overview of the mizar project
    • Gothenburg, Sweden Bastad
    • Piotr Rudnicki. An overview of the mizar project. In Workshop on Types for Proofs and Programs, Gothenburg, Sweden, 1992. Bastad. http://www.mizar.org.
    • (1992) Workshop on Types for Proofs and Programs
    • Rudnicki, P.1
  • 16
    • 57049139521 scopus 로고    scopus 로고
    • The Coq Development Team (Project TypiCal)
    • The Coq Development Team (Project TypiCal). The Coq proof assistant reference manual, 2008. http://coq.inria.fr/V8.1pl3/refman/index.html.
    • (2008) The Coq Proof Assistant Reference Manual


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