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.
Preview
Unable to display preview. Download preview PDF.
References
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).
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.
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.
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.
K. Apt, Ten years of Hoare's logic: A survey Part II: Nondeterminism, TCS 28 (1984), 83–109.
J.A. Bergstra and J.W. Klop, Proving program inclusion in Hoare's logic, TCS 30 (1984), 1–48.
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.
F. Berman, Semantics of looping programs in propositional dynamic logic, Math. Systems Theory 15 (1982), 285–294.
S.A. Cook, Soundness and completeness of an axiom system for program verification, SIAM J. Comp. 7 (1978), 70–90.
L. Csirmaz, Programs and program verification in a general setting, TCS 16 (1981), 199–210.
L. Csirmaz, On the strength of “Sometimes“ and “Always“ in program verification, Inf. Cntr. 57 (1983), 165–179.
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.
R.W. Floyd, Assigning meaning to programs, in: J.T. Schwartz (ed.), Math. Aspects of Comp. Sci., AMS 19 (1967), 19–32.
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.
D. Harel, First-order dynamic logic, Lect. Notes in Comp. Sci. 68 (1979).
D. Harel, Effective transformations on infinite trees, with applications to high undecidability, dominoes and fairness, to appear in J. ACM.
C.A.R. Hoare, An axiomatic basis for computer programming, Comm. ACM 12 (1969), 567–580.
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.
I. Németi, Nonstandard dynamic logic, in: D. Kozen (ed.), Logics of programs '81, Lect. Notes in Comp. Sci. 131 (1981), 311–348.
E.R. Olderog, On the notion of expressiveness and the rule of adaptation, TCS 24 (1983), 337–347.
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.
M. Rodríguez-Artalejo, Some questions about expressiveness and relative completeness in Hoare's logic, to appear in TCS.
I. Sain, Structured nonstandard dynamic logic, Z.f. Math. Logik u. Grund. d. Math. 30 (1984), 481–497.
I. Sain, The implicit information content of Burstall's (modal) programverification method, Preprint No. 57/1984, Math. Inst. Hungar. Acad. Sci. Budapest (1984).
J.R. Shoenfield, Mathematical Logic, Addison Wesley Pbl. Co. (1967).
M. Wand, A new incompleteness result for Hoare's system, J. ACM 25 (1968), 168–175.
Author information
Authors and Affiliations
Editor information
Rights 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