메뉴 건너뛰기




Volumn 199, Issue , 2008, Pages 17-32

A Coq Library for Verification of Concurrent Programs

Author keywords

concurrent programs; Coq; pi calculus; Proof assistant

Indexed keywords

ABSTRACTING; COMPUTER PROGRAMMING LANGUAGES; CONCURRENT ENGINEERING; ENCODING (SYMBOLS); VERIFICATION;

EID: 44449174548     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.11.010     Document Type: Article
Times cited : (7)

References (32)
  • 1
    • 0035035153 scopus 로고    scopus 로고
    • Abadi, Martín, and Cédric Fournet, Mobile values, new names, and secure communication, in 28th ACM Symposium on Principles of Programming Languages (POPL 2001), p. 104-115, ACM Press
    • Abadi, Martín, and Cédric Fournet, Mobile values, new names, and secure communication, in 28th ACM Symposium on Principles of Programming Languages (POPL 2001), p. 104-115, ACM Press
  • 2
    • 35248857958 scopus 로고    scopus 로고
    • Formalization and verification of a mail server in Coq
    • International Symposium on Software Security, Springer-Verlag
    • Affeldt R., and Kobayashi N. Formalization and verification of a mail server in Coq. International Symposium on Software Security. Lecture Notes in Computer Science volume 2609 (Feb. 2003), Springer-Verlag 217-233
    • (2003) Lecture Notes in Computer Science , vol.2609 , pp. 217-233
    • Affeldt, R.1    Kobayashi, N.2
  • 4
    • 15844383801 scopus 로고    scopus 로고
    • Partial Order Reduction for Verification of Spatial Properties of Pi-Calculus Processes
    • 11th International Workshop on Expressiveness in Concurrency. (EXPRESS 2004) Elsevier
    • Affeldt R., and Kobayashi N. Partial Order Reduction for Verification of Spatial Properties of Pi-Calculus Processes. 11th International Workshop on Expressiveness in Concurrency. (EXPRESS 2004). Electronic Notes in Theoretical Computer Science 128 2 (2005) 151-168 Elsevier
    • (2005) Electronic Notes in Theoretical Computer Science , vol.128 , Issue.2 , pp. 151-168
    • Affeldt, R.1    Kobayashi, N.2
  • 5
    • 44449167601 scopus 로고    scopus 로고
    • Black, Paul E., "Axiomatic Semantics Verification of a Secure Web Server," Ph.D. thesis, Department of Computer Science, Brigham Young University, 1998
    • Black, Paul E., "Axiomatic Semantics Verification of a Secure Web Server," Ph.D. thesis, Department of Computer Science, Brigham Young University, 1998
  • 6
    • 44449132635 scopus 로고    scopus 로고
    • Boulton, Richard, Andrew Gordon, Mike Gordon, John Harrison, John Herbert, and John Van Tassel, Experience with embedding hardware description languages in HOL, in IFIP TC10/WG 10.2 International Conference on Theorem Provers in Circuit Design: Theory, Practice and Experience, volume A-10 of IFIP Transactions, p. 129-156, Elsevier, 1992
    • Boulton, Richard, Andrew Gordon, Mike Gordon, John Harrison, John Herbert, and John Van Tassel, Experience with embedding hardware description languages in HOL, in IFIP TC10/WG 10.2 International Conference on Theorem Provers in Circuit Design: Theory, Practice and Experience, volume A-10 of IFIP Transactions, p. 129-156, Elsevier, 1992
  • 7
    • 0033726683 scopus 로고    scopus 로고
    • Cardelli, Luca, and Andrew D. Gordon, Anytime, anywhere: modal logics for mobile ambients, in 27th ACM Symposium on Principles of Programming Languages (POPL 2000), p. 365-377, ACM Press
    • Cardelli, Luca, and Andrew D. Gordon, Anytime, anywhere: modal logics for mobile ambients, in 27th ACM Symposium on Principles of Programming Languages (POPL 2000), p. 365-377, ACM Press
  • 8
    • 44449126627 scopus 로고    scopus 로고
    • Cervesato, Iliano, Frank Pfenning, David Walker, and Kevin Watkins, A concurrent logical framework II: Examples and applications, Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, May 2003
    • Cervesato, Iliano, Frank Pfenning, David Walker, and Kevin Watkins, A concurrent logical framework II: Examples and applications, Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, May 2003
  • 9
    • 0347499565 scopus 로고    scopus 로고
    • An axiomatization of linear temporal logic in the calculus of inductive constructions
    • Coupet-Grimal S. An axiomatization of linear temporal logic in the calculus of inductive constructions. Journal of Logic and Computation 13 6 (2003) 801-813
    • (2003) Journal of Logic and Computation , vol.13 , Issue.6 , pp. 801-813
    • Coupet-Grimal, S.1
  • 10
    • 0346868988 scopus 로고    scopus 로고
    • Formal verification of an incremental garbage collector
    • Coupet-Grimal S., and Nouvet C. Formal verification of an incremental garbage collector. Journal of Logic and Computation 13 6 (2003) 815-833
    • (2003) Journal of Logic and Computation , vol.13 , Issue.6 , pp. 815-833
    • Coupet-Grimal, S.1    Nouvet, C.2
  • 11
    • 9744273691 scopus 로고    scopus 로고
    • Proof Systems for the pi-calculus Logics
    • Logic for Concurrency and Synchronisation, Kluwer
    • Dam M. Proof Systems for the pi-calculus Logics. Logic for Concurrency and Synchronisation. Trends in Logic, Logica Library (2003), Kluwer
    • (2003) Trends in Logic, Logica Library
    • Dam, M.1
  • 12
    • 84947431245 scopus 로고
    • Higher-Order Abstract Syntax in Coq
    • 2nd International Conference on Typed Lambda Calculi and Applications. (TLCA 1995), Springer-Verlag
    • Despeyroux J., Felty A., and Hirschowitz A. Higher-Order Abstract Syntax in Coq. 2nd International Conference on Typed Lambda Calculi and Applications. (TLCA 1995). Lecture Notes in Computer Science volume 905 (Apr. 1995), Springer-Verlag 124-138
    • (1995) Lecture Notes in Computer Science , vol.905 , pp. 124-138
    • Despeyroux, J.1    Felty, A.2    Hirschowitz, A.3
  • 13
    • 23044518107 scopus 로고    scopus 로고
    • A higher-order specification of the π-calculus
    • IFIP Conference on Theoretical Computer Science 2000, Springer-Verlag
    • Despeyroux J. A higher-order specification of the π-calculus. IFIP Conference on Theoretical Computer Science 2000. Lecture Notes in Computer Science volume 1872 (Aug. 2000), Springer-Verlag 425-439
    • (2000) Lecture Notes in Computer Science , vol.1872 , pp. 425-439
    • Despeyroux, J.1
  • 14
    • 44449088941 scopus 로고    scopus 로고
    • Filliâtre, Jean-Christophe, Why: a multi-language multi-prover verification tool, Research Report 1366, LRI, Université Paris Sud, Mar. 2003
    • Filliâtre, Jean-Christophe, Why: a multi-language multi-prover verification tool, Research Report 1366, LRI, Université Paris Sud, Mar. 2003
  • 15
    • 44449111715 scopus 로고    scopus 로고
    • A framework for the formalisation of pi calculus type systems in Isabelle/HOL
    • Theorem Proving in Higher Order Logics. (TPHOLs 2001), Springer-Verlag
    • Gay S.J. A framework for the formalisation of pi calculus type systems in Isabelle/HOL. Theorem Proving in Higher Order Logics. (TPHOLs 2001). Lecture Notes in Computer Science volume 2152 (Sep. 2001), Springer-Verlag 217-232
    • (2001) Lecture Notes in Computer Science , vol.2152 , pp. 217-232
    • Gay, S.J.1
  • 16
    • 84956853032 scopus 로고    scopus 로고
    • A modular coding of UNITY in Coq
    • Theorem Proving in Higher Order Logics. (TPHOLs 1996), Springer-Verlag
    • Heyd B., and Crégut P. A modular coding of UNITY in Coq. Theorem Proving in Higher Order Logics. (TPHOLs 1996). Lecture Notes in Computer Science volume 1125 (Aug. 1996), Springer-Verlag 251-266
    • (1996) Lecture Notes in Computer Science , vol.1125 , pp. 251-266
    • Heyd, B.1    Crégut, P.2
  • 17
    • 44449158170 scopus 로고    scopus 로고
    • Hirschkoff, Daniel, "Mise en œuvre de preuves de bisimulation," Ph.D. thesis, École Nationale des Ponts et Chaussées, 1999
    • Hirschkoff, Daniel, "Mise en œuvre de preuves de bisimulation," Ph.D. thesis, École Nationale des Ponts et Chaussées, 1999
  • 19
    • 0037107029 scopus 로고    scopus 로고
    • A type system for lock-free processes
    • Kobayashi N. A type system for lock-free processes. Information and Computation 177 2 (Sep. 2002) 122-159
    • (2002) Information and Computation , vol.177 , Issue.2 , pp. 122-159
    • Kobayashi, N.1
  • 20
    • 35248841612 scopus 로고    scopus 로고
    • Type systems for concurrent programs
    • Tutorial. March 2002, Lisbon, Portugal, Springer-Verlag
    • Kobayashi N. Type systems for concurrent programs. Tutorial. UNU/IIST 10th Anniversary Colloquium. March 2002, Lisbon, Portugal (2002), Springer-Verlag
    • (2002) UNU/IIST 10th Anniversary Colloquium
    • Kobayashi, N.1
  • 21
    • 0029706996 scopus 로고    scopus 로고
    • Kobayashi, Naoki, Benjamin C. Pierce, and David N. Turner, Linearity and the Pi-Calculus, in 23rd ACM Symposium on Principles of Programming Languages (POPL 1996), p. 358-371, ACM Press.
    • Kobayashi, Naoki, Benjamin C. Pierce, and David N. Turner, Linearity and the Pi-Calculus, in 23rd ACM Symposium on Principles of Programming Languages (POPL 1996), p. 358-371, ACM Press.
  • 22
    • 44449095062 scopus 로고    scopus 로고
    • Manolios, Panagiotis, "Mechanical Verification of Reactive Systems," Ph.D. thesis, The University of Texas at Austin, Department of Computer Sciences, Austin, TX, 2001
    • Manolios, Panagiotis, "Mechanical Verification of Reactive Systems," Ph.D. thesis, The University of Texas at Austin, Department of Computer Sciences, Austin, TX, 2001
  • 23
    • 0002928110 scopus 로고
    • A Mechanized Theory of the π-calculus in HOL
    • Melham T.F. A Mechanized Theory of the π-calculus in HOL. Nordic Journal of Computing 1 1 (1995) 50-76
    • (1995) Nordic Journal of Computing , vol.1 , Issue.1 , pp. 50-76
    • Melham, T.F.1
  • 24
  • 27
    • 44449176588 scopus 로고    scopus 로고
    • Pierce, Benjamin C., and Jérôme Vouillon, Specifying a file synchronizer, Draft, Mar. 2002
    • Pierce, Benjamin C., and Jérôme Vouillon, Specifying a file synchronizer, Draft, Mar. 2002
  • 28
    • 84885653712 scopus 로고    scopus 로고
    • Higher-order abstract syntax with induction in Isabelle/HOL: Formalizing the pi-calculus and mechanizing the theory of contexts
    • Foundations of Software Science and Computation Structures. (FOSSACS 2001), Springer-Verlag
    • Röckl C., Hirschkoff D., and Berghofer S. Higher-order abstract syntax with induction in Isabelle/HOL: Formalizing the pi-calculus and mechanizing the theory of contexts. Foundations of Software Science and Computation Structures. (FOSSACS 2001). Lecture Notes in Computer Science number 2030 (Apr. 2001), Springer-Verlag
    • (2001) Lecture Notes in Computer Science , vol.number 2030
    • Röckl, C.1    Hirschkoff, D.2    Berghofer, S.3
  • 29
    • 19044374305 scopus 로고    scopus 로고
    • Ambient calculus and its logic in the calculus of inductive constructions
    • 3rd International Workshop on Logical Frameworks and Meta-Languages. (LFM 2002) Elsevier
    • Scagnetto I., and Miculan M. Ambient calculus and its logic in the calculus of inductive constructions. 3rd International Workshop on Logical Frameworks and Meta-Languages. (LFM 2002). Electronic Notes in Theoretical Computer Science 70 2 (2002) Elsevier
    • (2002) Electronic Notes in Theoretical Computer Science , vol.70 , Issue.2
    • Scagnetto, I.1    Miculan, M.2
  • 30
    • 44449118470 scopus 로고    scopus 로고
    • The Coq Development Team, "The Coq Proof Assistant Reference Manual," INRIA, 2004
    • The Coq Development Team, "The Coq Proof Assistant Reference Manual," INRIA, 2004
  • 31
    • 44449132111 scopus 로고    scopus 로고
    • Watkins, Kevin, Iliano Cervesato, Frank Pfenning, and David Walker, A concurrent logical framework I: Judgments and properties, Technical Report CMU-CS-02-101, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, May 2003
    • Watkins, Kevin, Iliano Cervesato, Frank Pfenning, and David Walker, A concurrent logical framework I: Judgments and properties, Technical Report CMU-CS-02-101, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, May 2003
  • 32
    • 44449120309 scopus 로고    scopus 로고
    • Yu, Shen-Wei, "Formal Verification of Concurrent Programs Based on Type Theory," Ph.D. thesis, Department of Computer Science, University of Durham, 1998
    • Yu, Shen-Wei, "Formal Verification of Concurrent Programs Based on Type Theory," Ph.D. thesis, Department of Computer Science, University of Durham, 1998


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