Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Hoare's logic for nondeterministic regular programs: A nonstandard completeness theorem

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 194))

Included in the following conference series:

  • 132 Accesses

Abstract

The paper characterizes formal derivability in a Hoare's calculus for nondeterministic regular programs, by means of a nonstandard semantics which allows certain “infinitely long computations“. Our result generalizes a previous one of Csirmaz [10] and uses some properties of a normal form for regular programs which are perhaps interesting in its own right.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Andréka and I. Németi, Completeness of Floyd's program verification method w.r.t. nonstandard time models, Seminar Notes Math. Inst. Hungar. Acad. Sci., SZKI (1977) (in Hungarian).

    Google Scholar 

  2. H. Andréka, I. Németi and I. Sain, Completeness problems in verification of programs and programs schemes, in: J. Bécvar (ed.), Math. Found. of Comp. Sci. 79, Lect. Notes in Comp. Sci. 74 (1979), 208–218.

    Google Scholar 

  3. H. Andréka, I. Németi and I. Sain, A characterization of Floyd's provable programs, in: J. Gruska and M. Chytil (eds.), Math. Found. of Comp. Sci. 81, Lect. Notes in Comp. Sci. 118 (1981), 162–171.

    Google Scholar 

  4. H. Andréka, I. Németi and I. Sain, A complete logic for reasoning about programs via nonstandard model theory, Parts I–II, TCS 17 (1982), 193–212 and 259–278.

    Article  Google Scholar 

  5. K. Apt, Ten years of Hoare's logic: A survey Part II: Nondeterminism, TCS 28 (1984), 83–109.

    Article  Google Scholar 

  6. J.A. Bergstra and J.W. Klop, Proving program inclusion in Hoare's logic, TCS 30 (1984), 1–48.

    Article  Google Scholar 

  7. J.A. Bergstra and J.V. Tucker, Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while—programs, TCS 17 (1982), 303–315.

    Article  Google Scholar 

  8. F. Berman, Semantics of looping programs in propositional dynamic logic, Math. Systems Theory 15 (1982), 285–294.

    Article  Google Scholar 

  9. S.A. Cook, Soundness and completeness of an axiom system for program verification, SIAM J. Comp. 7 (1978), 70–90.

    Article  Google Scholar 

  10. L. Csirmaz, Programs and program verification in a general setting, TCS 16 (1981), 199–210.

    Article  Google Scholar 

  11. L. Csirmaz, On the strength of “Sometimes“ and “Always“ in program verification, Inf. Cntr. 57 (1983), 165–179.

    Article  Google Scholar 

  12. L. Csirmaz and J.B. Paris, A property of 2-sorted Peano models and program verification, Z. f. Math. Logik u. Grund. d. Math. 30 (1984), 325–334.

    Google Scholar 

  13. R.W. Floyd, Assigning meaning to programs, in: J.T. Schwartz (ed.), Math. Aspects of Comp. Sci., AMS 19 (1967), 19–32.

    Google Scholar 

  14. P. Hajek, Making dynamic logic first order, in: J. Gruska and M. Chytil (eds.), Math. Found. of Comp. Sci. 81, Lect. Notes in Comp. Sci. 118 (1981), 287–295.

    Google Scholar 

  15. D. Harel, First-order dynamic logic, Lect. Notes in Comp. Sci. 68 (1979).

    Google Scholar 

  16. D. Harel, Effective transformations on infinite trees, with applications to high undecidability, dominoes and fairness, to appear in J. ACM.

    Google Scholar 

  17. C.A.R. Hoare, An axiomatic basis for computer programming, Comm. ACM 12 (1969), 567–580.

    Article  Google Scholar 

  18. I. Németi, Nonstandard runs of Floyd-provable programs, in: A. Salwicki (ed.), Logics of programs and their applications '80, Lect. Notes in Comp. Sci. 148 (1983), 186–204.

    Google Scholar 

  19. I. Németi, Nonstandard dynamic logic, in: D. Kozen (ed.), Logics of programs '81, Lect. Notes in Comp. Sci. 131 (1981), 311–348.

    Google Scholar 

  20. E.R. Olderog, On the notion of expressiveness and the rule of adaptation, TCS 24 (1983), 337–347.

    Article  Google Scholar 

  21. R. Parikh, The completeness of propositional dynamic logic, in: J. Winkowski (ed.), Math. Found. of Comp. Sci. '78, Lect. Notes in Comp. Sci. 64 (1978), 403–415.

    Google Scholar 

  22. M. Rodríguez-Artalejo, Some questions about expressiveness and relative completeness in Hoare's logic, to appear in TCS.

    Google Scholar 

  23. I. Sain, Structured nonstandard dynamic logic, Z.f. Math. Logik u. Grund. d. Math. 30 (1984), 481–497.

    Google Scholar 

  24. I. Sain, The implicit information content of Burstall's (modal) programverification method, Preprint No. 57/1984, Math. Inst. Hungar. Acad. Sci. Budapest (1984).

    Google Scholar 

  25. J.R. Shoenfield, Mathematical Logic, Addison Wesley Pbl. Co. (1967).

    Google Scholar 

  26. M. Wand, A new incompleteness result for Hoare's system, J. ACM 25 (1968), 168–175.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Ecuaciones Funcionales Facultad de Matemáticas, Universidad Complutense, 28040, Madrid, Spain

    Ma T. Hortalá-González & M. Rodríguez-Artalejo

Authors
  1. Ma T. Hortalá-González
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Rodríguez-Artalejo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wilfried Brauer

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hortalá-González, M.T., Rodríguez-Artalejo, M. (1985). Hoare's logic for nondeterministic regular programs: A nonstandard completeness theorem. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015752

Download citation

  • DOI: https://doi.org/10.1007/BFb0015752

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15650-5

  • Online ISBN: 978-3-540-39557-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation