메뉴 건너뛰기




Volumn 1, Issue 1, 2000, Pages 60-76

On Hoare Logic and Kleene Algebra with Tests

Author keywords

Design; Dynamic logic; Hoare logic; Kleene algebra; Kleene algebra with tests; Languages; specification; Theory; Verification

Indexed keywords


EID: 84876887451     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/343369.343378     Document Type: Article
Times cited : (147)

References (23)
  • 1
    • 0000860669 scopus 로고
    • Floyd-Hoare logic in iteration theories
    • Oct. 1991
    • Bloom, S. L. and Ésik, Z. 1991. Floyd-Hoare logic in iteration theories. J. ACM 38, 4 (Oct. 1991), 887-934.
    • (1991) J. ACM , vol.38 , Issue.4 , pp. 887-934
    • Bloom, S.L.1    Ésik, Z.2
  • 3
    • 0020780386 scopus 로고
    • Effective axiomatizations of Hoare logics
    • July
    • Clarke, E. M., German, S. M., and Halpern, J. Y. 1983. Effective axiomatizations of Hoare logics. J. ACM 30, 3 (July), 612-636.
    • (1983) J. ACM , vol.30 , Issue.3 , pp. 612-636
    • Clarke, E.M.1    German, S.M.2    Halpern, J.Y.3
  • 4
    • 0012163826 scopus 로고
    • Hypotheses in Kleene algebra
    • Available as ftp://ftp.telcordia.com/pub/ernie/research/homepage.html
    • Cohen, E. 1994. Hypotheses in Kleene algebra. Available as ftp://ftp.telcordia.com/pub/ernie/research/homepage.html.
    • (1994)
    • Cohen, E.1
  • 5
    • 0012193437 scopus 로고    scopus 로고
    • The complexity of Kleene algebra with tests. Tech. Rep
    • Department of Computer Science, Cornell University, Ithaca, NY.
    • Cohen, E., Kozen, D., and Smith, F. 1996. The complexity of Kleene algebra with tests. Tech. Rep. 96-1598. Department of Computer Science, Cornell University, Ithaca, NY.
    • (1996) , pp. 96-1598
    • Cohen, E.1    Kozen, D.2    Smith, F.3
  • 7
    • 0002896911 scopus 로고
    • Soundness and completeness of an axiom system for program verification
    • Feb.
    • Cook, S. A. 1978. Soundness and completeness of an axiom system for program verification. SIAM J. Comput. 7, 1 (Feb.), 70-90.
    • (1978) SIAM J. Comput. , vol.7 , Issue.1 , pp. 70-90
    • Cook, S.A.1
  • 8
    • 0001972404 scopus 로고
    • Methods and logics for proving programs
    • Formal Models and Semantics, J. van Leeuwen, Ed. MIT Press, Cambridge, MA
    • Cousot, P. 1990. Methods and logics for proving programs. In Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics, J. van Leeuwen, Ed. MIT Press, Cambridge, MA, 841-993.
    • (1990) Handbook of Theoretical Computer Science , vol.B , pp. 841-993
    • Cousot, P.1
  • 9
    • 0018454915 scopus 로고
    • Propositional dynamic logic of regular programs
    • Fischer, M. J. and Ladner, R. E. 1979. Propositional dynamic logic of regular programs. J. Comput. Syst. Sci. 18, 2, 194-211.
    • (1979) J. Comput. Syst. Sci. , vol.18 , Issue.2 , pp. 194-211
    • Fischer, M.J.1    Ladner, R.E.2
  • 11
    • 0012624752 scopus 로고
    • The propositional logic of deterministic, well-structured programs
    • Halpern, J. Y. and Reif, J. H. 1983. The propositional logic of deterministic, well-structured programs. Theor. Comput. Sci. 27, 127-165.
    • (1983) Theor. Comput. Sci. 27 , pp. 127-165
    • Halpern, J.Y.1    Reif, J.H.2
  • 12
    • 84945708698 scopus 로고
    • An axiomatic basis for computer programming
    • Hoare, C. 1969. An axiomatic basis for computer programming. Commun. ACM 12, 10, 576-583.
    • (1969) Commun. ACM , vol.12 , Issue.10 , pp. 576-583
    • Hoare, C.1
  • 13
    • 0025508759 scopus 로고
    • A semiring on convex polygons and zero-sum cycle problems
    • Oct. 1990
    • Iwano, K. and Steiglitz, K. 1990. A semiring on convex polygons and zero-sum cycle problems. SIAM J. Comput. 19, 5 (Oct. 1990), 883-901.
    • (1990) SIAM J. Comput. , vol.19 , Issue.5 , pp. 883-901
    • Iwano, K.1    Steiglitz, K.2
  • 14
    • 0003067817 scopus 로고
    • Representation of events in nerve nets and finite automata
    • C. E. Shannon and J. McCarthy, Eds. Princeton University Press, Princeton, NJ
    • Kleene, S. C. 1956. Representation of events in nerve nets and finite automata. In Automata Studies, C. E. Shannon and J. McCarthy, Eds. Princeton University Press, Princeton, NJ, 3-41.
    • (1956) Automata Studies , pp. 3-41
    • Kleene, S.C.1
  • 15
    • 0000042790 scopus 로고
    • A completeness theorem for Kleene algebras and the algebra of regular events
    • May 1, 1994
    • Kozen, D. 1994. A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput. 110, 2 (May 1, 1994), 366-390.
    • (1994) Inf. Comput. , vol.110 , Issue.2 , pp. 366-390
    • Kozen, D.1
  • 16
    • 0031141317 scopus 로고    scopus 로고
    • Kleene algebra with tests
    • Kozen, D. 1997. Kleene algebra with tests. ACM Trans. Program. Lang. Syst. 19, 3, 427-443.
    • (1997) ACM Trans. Program. Lang. Syst. , vol.19 , Issue.3 , pp. 427-443
    • Kozen, D.1
  • 17
    • 84958748064 scopus 로고    scopus 로고
    • Kleene algebra with tests: Completeness and decidability
    • (CSL'96, Utrecht, The Netherlands, Sept.), D. van Dalen and M. Bezem, Eds. Springer Lecture Notes in Computer Science Springer-Verlag, New York
    • Kozen, D. and Smith, F. 1996. Kleene algebra with tests: Completeness and decidability. In Proceedings of the 10th International Workshop on Computer Science Logic (CSL'96, Utrecht, The Netherlands, Sept.), D. van Dalen and M. Bezem, Eds. Springer Lecture Notes in Computer Science Springer-Verlag, New York, 244-259.
    • (1996) Proceedings of the 10th International Workshop on Computer Science Logic , pp. 244-259
    • Kozen, D.1    Smith, F.2
  • 19
    • 85024283840 scopus 로고    scopus 로고
    • Springer Lecture Notes in Computer Science
    • Eds Springer-Verlag, New York, NY
    • M. G. Main, A. C. Melton, and M. W. Mislove, Eds. Springer Lecture Notes in Computer Science, vol. 442. Springer-Verlag, New York, NY, 247-270.
    • , vol.442 , pp. 247-270
    • Main, M.G.1    Melton, A.C.2    Mislove, M.W.3
  • 21
    • 0011239813 scopus 로고
    • MIT Press series in the foundations of computing. Massachusetts Institute of Technology, Cambridge, MA
    • O'Donnell, M. J. 1985. Equational Logic as a Programming Language. MIT Press series in the foundations of computing. Massachusetts Institute of Technology, Cambridge, MA.
    • (1985) Equational Logic as a Programming Language
    • O'Donnell, M.J.1
  • 22
    • 0018056096 scopus 로고
    • A practical decision method for propositional dynamic logic
    • ACM Press, New York, NY
    • Pratt, V. R. 1978. A practical decision method for propositional dynamic logic. In Proceedings of the 10th Symposium on Theory of Computing, ACM Press, New York, NY, 326-337.
    • (1978) Proceedings of the 10th Symposium on Theory of Computing , pp. 326-337
    • Pratt, V.R.1
  • 23
    • 0039568464 scopus 로고
    • Equational logic
    • Survey
    • Taylor, W. 1979. Equational logic. Houston J. Math., 1-83. Survey.
    • (1979) Houston J. Math. , pp. 1-83
    • Taylor, W.1


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