메뉴 건너뛰기




Volumn 1657, Issue , 1999, Pages 133-149

Metatheory of verification calculi in LEGO: To what extent does syntax matter?

Author keywords

[No Author keywords available]

Indexed keywords

PATHOLOGY; SEMANTICS; SYNTACTICS;

EID: 59249098560     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48167-2_10     Document Type: Conference Paper
Times cited : (4)

References (31)
  • 2
    • 0042665299 scopus 로고
    • Completeness with finite systems of intermediate assertions for recursive program schemes
    • November, 133
    • Krzysztof R. Apt and Lambert G. L. T. Meertens. Completeness with finite systems of intermediate assertions for recursive program schemes. SIAM Journal on Computing, 9(4):665-671, November 1980. 133.
    • (1980) SIAM Journal on Computing , vol.9 , Issue.4 , pp. 665-671
    • Apt, K.R.1    Meertens, L.G.L.T.2
  • 3
    • 84945708698 scopus 로고
    • An axiomaticb asis for computer programming
    • 134, 140
    • C. A. R. Hoare. An axiomaticb asis for computer programming. Communications of the ACM, 12:576-580, 1969. 134, 140.
    • (1969) Communications of the ACM , vol.12 , pp. 576-580
    • Hoare, C.A.R.1
  • 5
    • 84976766710 scopus 로고
    • Ten years of Hoare’s logic: A survey - Part I
    • October, 134, 145
    • Krzysztof R. Apt. Ten years of Hoare’s logic: A survey - part I. ACM Transactions on Programming Languages and Systems, 3(4):431-483, October 1981. 134, 145.
    • (1981) ACM Transactions on Programming Languages and Systems , vol.3 , Issue.4 , pp. 431-483
    • Apt, K.R.1
  • 6
    • 0042240361 scopus 로고
    • Mechanizing programming logics in higher order logic
    • G. Birtwhistle and P. A. Subrahmanyam, editors, number 15 in Workshops in Computing, Springer-Verlag,134, 138, 139, 142
    • Michael J. C. Gordon. Mechanizing programming logics in higher order logic. In G. Birtwhistle and P. A. Subrahmanyam, editors, Current Trends in Hardware Verification and Automated Theorem Proving (Banff, Alberta), number 15 in Workshops in Computing, pages 387-439. Springer-Verlag, 1989. 134, 138, 139, 142.
    • (1989) Current Trends in Hardware Verification and Automated Theorem Proving (Banff, Alberta) , pp. 387-439
    • Gordon, M.J.C.1
  • 8
    • 0013135170 scopus 로고    scopus 로고
    • Winskel is (almost) right: Towards a mechanized semantics textbook
    • 134, 138, 142
    • Tobias Nipkow. Winskel is (almost) right: Towards a mechanized semantics textbook. Formal Aspects of Computing, 10:171-186, 1998. 134, 138, 142.
    • (1998) Formal Aspects of Computing , vol.10 , pp. 171-186
    • Nipkow, T.1
  • 9
    • 84957025978 scopus 로고
    • Technical Report 32, Laboratory for Foundations of Computer Science, University of Edinburgh, June 135
    • Ian A. Mason. Hoare’s logicin the LF. Technical Report 32, Laboratory for Foundations of Computer Science, University of Edinburgh, June 1987. 135.
    • (1987) Hoare’s logicin the LF
    • Mason, I.A.1
  • 10
    • 0006745619 scopus 로고    scopus 로고
    • PhD thesis ECS-LFCS-98-392, Laboratory for Foundations of Computer Science, University of Edinburgh, September 136, 140, 141
    • Thomas Kleymann. Hoare Logic and VDM: Machine-checked soundness and completeness proofs. PhD thesis ECS-LFCS-98-392, Laboratory for Foundations of Computer Science, University of Edinburgh, September 1998. 136, 140, 141.
    • (1998) Hoare Logic and VDM: Machine-checked soundness and completeness proofs
    • Kleymann, T.1
  • 13
    • 84957655517 scopus 로고    scopus 로고
    • Mechanical verification of mutually recursive procedures
    • M. A.McRobbie and J. K. Slaney, editors, New Brunswick, NJ, USA, July/August, Springer-Verlag. 13th International Conference on Automated Deduction. 136, 142
    • Peter V. Homeier and David F. Martin. Mechanical verification of mutually recursive procedures. InM. A.McRobbie and J. K. Slaney, editors, Automated Deduction - CADE-13, volume 1104 of Lecture Notes in Artificial Intelligence, pages 201-215, New Brunswick, NJ, USA, July/August 1996. Springer-Verlag. 13th International Conference on Automated Deduction. 136, 142.
    • (1996) Automated Deduction - CADE-13, volume 1104 of Lecture Notes in Artificial Intelligence , pp. 201-215
    • Homeier, P.V.1    Martin, D.F.2
  • 14
    • 0012627019 scopus 로고
    • Idealized Algol and its specification logic
    • D. Néel, editor, Cambridge University Press, 136
    • John C. Reynolds. Idealized Algol and its specification logic. In D. Néel, editor, Tools & Notions for ProgramConstructi on. Cambridge University Press, 1982. 136.
    • (1982) Tools & Notions for ProgramConstructi on
    • Reynolds, J.C.1
  • 15
    • 0017793502 scopus 로고
    • Programming language constructs for which it is impossible to obtain good Hoare axiom systems
    • January, 137
    • Edmund Melson Clarke Jr. Programming language constructs for which it is impossible to obtain good Hoare axiom systems. Journal of the ACM, 26(1):129-147, January 1979. 137.
    • (1979) Journal of the ACM , vol.26 , Issue.1 , pp. 129-147
    • Jr, E.M.C.1
  • 16
    • 0001972404 scopus 로고
    • Methods and logics for proving programs
    • Jan van Leeuwen, editor, volume B: Formal Models and Semantics, chapter 15, Elsevier,139
    • Patrick Cousot. Methods and logics for proving programs. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapter 15, pages 841-993. Elsevier, 1990. 139.
    • (1990) Handbook of Theoretical Computer Science , pp. 841-993
    • Cousot, P.1
  • 17
    • 0002780749 scopus 로고
    • Assigning meanings to programs
    • J. T. Schwartz, editor, volume 19,140
    • Robert W. Floyd. Assigning meanings to programs. In J. T. Schwartz, editor, Proc. Symp. in Applied Mathematics, volume 19, pages 19-32, 1967. 140.
    • (1967) Proc. Symp. in Applied Mathematics , pp. 19-32
    • Floyd, R.W.1
  • 18
    • 0015960562 scopus 로고
    • Axiomatic approach to total correctness of programs
    • 140
    • Z. Manna and A. Pnueli. Axiomatic approach to total correctness of programs. Acta Informatica, 3:243-263, 1974. 140.
    • (1974) Acta Informatica , vol.3 , pp. 243-263
    • Manna, Z.1    Pnueli, A.2
  • 19
    • 9744274994 scopus 로고
    • Proving the correctness of regular deterministic programs: A unifying survey using dynamiclogic
    • 140
    • David Harel. Proving the correctness of regular deterministic programs: A unifying survey using dynamiclogic. Theoretical Computer Science, 12:61-81, 1980. 140.
    • (1980) Theoretical Computer Science , vol.12 , pp. 61-81
    • Harel, D.1
  • 21
    • 0018504528 scopus 로고
    • Proving termination with multiset orderings
    • August, 140
    • Nachum Dershowitz and Zohar Manna. Proving termination with multiset orderings. Communications of the ACM, 22(8):465-475, August 1979. 140.
    • (1979) Communications of the ACM , vol.22 , Issue.8 , pp. 465-475
    • Dershowitz, N.1    Manna, Z.2
  • 22
    • 84957000459 scopus 로고    scopus 로고
    • Auxiliary variables and recursive procedures
    • Michel Bidoit and Max Dauchet, editors, Lille, France, April Springer-Verlag. 141
    • Thomas Schreiber. Auxiliary variables and recursive procedures. In Michel Bidoit and Max Dauchet, editors, Proceedings of TAPSOFT ’97, volume 1214 of Lecture Notes in Computer Science, pages 697-711, Lille, France, April 1997. Springer-Verlag. 141.
    • (1997) Proceedings of TAPSOFT ’97, volume 1214 of Lecture Notes in Computer Science , pp. 697-711
    • Schreiber, T.1
  • 23
    • 33646728567 scopus 로고    scopus 로고
    • Technical Report ECSLFCS-98-399, Laboratory for Foundations of Computer Science, University of Edinburgh, October Submitted to Formal Aspects of Computing. 141
    • Thomas Kleymann. Hoare Logican d auxiliary variables. Technical Report ECSLFCS-98-399, Laboratory for Foundations of Computer Science, University of Edinburgh, October 1998. Submitted to Formal Aspects of Computing. 141.
    • (1998) Hoare Logican d auxiliary variables
    • Kleymann, T.1
  • 24
    • 84956973715 scopus 로고    scopus 로고
    • Derivation of verification rules for C from operational definitions
    • Joakim von Wright, Jim Grundy, and John Harrison, editors, number 1 in TUCS General Publications, Turku Centre for Computer Science, August,142
    • Michael Norrish. Derivation of verification rules for C from operational definitions. In Joakim von Wright, Jim Grundy, and John Harrison, editors, Supplementary Proceedings of the 9th International Conference on TheoremP roving in Higher Order Logics: TPHOLs’96, number 1 in TUCS General Publications, pages 69-75. Turku Centre for Computer Science, August 1996. 142.
    • (1996) Supplementary Proceedings of the 9th International Conference on TheoremP roving in Higher Order Logics: TPHOLs’96 , pp. 69-75
    • Norrish, M.1
  • 25
    • 0002896911 scopus 로고
    • Soundness and completeness of an axiom system for program verification
    • February, 143
    • Stephen A. Cook. Soundness and completeness of an axiom system for program verification. SIAM Journal on Computing, 7(1):70-90, February 1978. 143.
    • (1978) SIAM Journal on Computing , vol.7 , Issue.1 , pp. 70-90
    • Cook, S.A.1
  • 28
  • 29
    • 0019698884 scopus 로고
    • Sound and complete Hoare-like calculi based on copy rules
    • 144
    • Ernst-Rüdiger Olderog. Sound and complete Hoare-like calculi based on copy rules. Acta Informatica, 16:161-197, 1981. 144.
    • (1981) Acta Informatica , vol.16 , pp. 161-197
    • Olderog, E.-R.1
  • 30
    • 0003586320 scopus 로고
    • PhD thesis, Laboratory for Foundations of Computer Science, University of Edinburgh, 145
    • Martin Hofmann. Extensional concepts in intensional type theory. PhD thesis, Laboratory for Foundations of Computer Science, University of Edinburgh, 1995. 145.
    • (1995) Extensional concepts in intensional type theory
    • Hofmann, M.1


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