메뉴 건너뛰기




Volumn 7180 LNCS, Issue , 2012, Pages 289-303

Automatic Verification of TLA + proof obligations with SMT solvers

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC VERIFICATION; DEGREE OF AUTOMATION; FORMAL SPECIFICATION LANGUAGE; INTERACTIVE PROOFS; PROOF OBLIGATIONS; PROOF SYSTEM; SAFETY PROPERTY; TEMPORAL LOGIC OF ACTIONS; TYPE INFORMATION;

EID: 84858325008     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-28717-6_23     Document Type: Conference Paper
Times cited : (26)

References (13)
  • 1
    • 77955251743 scopus 로고    scopus 로고
    • The SMT-LIB standard: Version 2.0
    • Gupta, A., Kroening, D. (eds.) Edinburgh, UK
    • Barrett, C., Stump, A., Tinelli, C.: The SMT-LIB standard: Version 2.0. In: Gupta, A., Kroening, D. (eds.) Satisfiability Modulo Theories (SMT 2010), Edinburgh, UK (2010), http://www.SMT-LIB.org
    • (2010) Satisfiability Modulo Theories (SMT 2010)
    • Barrett, C.1    Stump, A.2    Tinelli, C.3
  • 2
    • 38149123956 scopus 로고    scopus 로고
    • CVC3
    • Damm, W., Hermanns, H. (eds.) CAV 2007. Springer, Heidelberg
    • Barrett, C.W., Tinelli, C.: CVC3. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 298-302. Springer, Heidelberg (2007)
    • (2007) LNCS , vol.4590 , pp. 298-302
    • Barrett, C.W.1    Tinelli, C.2
  • 3
    • 80051683224 scopus 로고    scopus 로고
    • Extending Sledgehammer with SMT Solvers
    • Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. Springer, Heidelberg
    • Blanchette, J.C., Böhme, S., Paulson, L.C.: Extending Sledgehammer with SMT Solvers. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS, vol. 6803, pp. 116-130. Springer, Heidelberg (2011)
    • (2011) LNCS , vol.6803 , pp. 116-130
    • Blanchette, J.C.1    Böhme, S.2    Paulson, L.C.3
  • 4
    • 38149090186 scopus 로고    scopus 로고
    • Zenon: An Extensible Automated Theorem Prover Producing Checkable Proofs
    • Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. Springer, Heidelberg
    • Bonichon, R., Delahaye, D., Doligez, D.: Zenon: An Extensible Automated Theorem Prover Producing Checkable Proofs. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 151-165. Springer, Heidelberg (2007)
    • (2007) LNCS (LNAI) , vol.4790 , pp. 151-165
    • Bonichon, R.1    Delahaye, D.2    Doligez, D.3
  • 5
    • 77955264460 scopus 로고    scopus 로고
    • + Proof System
    • Giesl, J., Hähnle, R. (eds.) IJCAR 2010. Springer, Heidelberg
    • + Proof System. In: Giesl, J., Hähnle, R. (eds.) IJCAR 2010. LNCS, vol. 6173, pp. 142-148. Springer, Heidelberg (2010)
    • (2010) LNCS , vol.6173 , pp. 142-148
    • Chaudhuri, K.1    Doligez, D.2    Lamport, L.3    Merz, S.4
  • 6
    • 45749085681 scopus 로고    scopus 로고
    • Z3: An Efficient SMT Solver
    • Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. Springer, Heidelberg
    • de Moura, L., Bjørner, N.S.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.4963 , pp. 337-340
    • De Moura, L.1    Bjørner, N.S.2
  • 7
    • 77950799087 scopus 로고    scopus 로고
    • Automatic Verification for a Class of Proof Obligations with SMT-Solvers
    • Frappier, M., Glässer, U., Khurshid, S., Laleau, R., Reeves, S. (eds.) ABZ 2010. Springer, Heidelberg
    • Déharbe, D.: Automatic Verification for a Class of Proof Obligations with SMT-Solvers. In: Frappier, M., Glässer, U., Khurshid, S., Laleau, R., Reeves, S. (eds.) ABZ 2010. LNCS, vol. 5977, pp. 217-230. Springer, Heidelberg (2010)
    • (2010) LNCS , vol.5977 , pp. 217-230
    • Déharbe, D.1
  • 9
    • 0016090932 scopus 로고
    • A new solution of Dijkstra's concurrent programming problem
    • Lamport, L.: A new solution of Dijkstra's concurrent programming problem. Communications of the ACM 17(8), 453-454 (1974)
    • (1974) Communications of the ACM , vol.17 , Issue.8 , pp. 453-454
    • Lamport, L.1
  • 11
    • 0003897323 scopus 로고    scopus 로고
    • Should your specification language be typed?
    • Lamport, L., Paulson, L.C.: Should your specification language be typed? ACM Trans. Prog. Lang. Syst. 21(3), 502-526 (1999)
    • (1999) ACM Trans. Prog. Lang. Syst. , vol.21 , Issue.3 , pp. 502-526
    • Lamport, L.1    Paulson, L.C.2
  • 12
    • 80051981604 scopus 로고    scopus 로고
    • Memoir: Practical state continuity for protected modules
    • IEEE Computer Society. Formal Specifications and Correctness Proofs: Tech. Report, Microsoft Research February
    • Parno, B., Lorch, J.R., Douceur, J.R., Mickens, J., McCune, J.M.: Memoir: Practical state continuity for protected modules. In: IEEE Symp. Security and Privacy, Berkeley, California, U.S.A., 2011. IEEE Computer Society. Formal Specifications and Correctness Proofs: Tech. Report, Microsoft Research (February 2011)
    • (2011) IEEE Symp. Security and Privacy, Berkeley, California, U.S.A., 2011
    • Parno, B.1    Lorch, J.R.2    Douceur, J.R.3    Mickens, J.4    McCune, J.M.5
  • 13
    • 57049134167 scopus 로고    scopus 로고
    • The Isabelle Framework
    • Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) TPHOLs 2008. Springer, Heidelberg
    • Wenzel, M., Paulson, L.C., Nipkow, T.: The Isabelle Framework. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 33-38. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5170 , pp. 33-38
    • Wenzel, M.1    Paulson, L.C.2    Nipkow, T.3


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