This paper studies Hoare's logic for nondeterministic regular programs (with unbounded nondeterminism) from the point of view of nonstandard dynamic logic.

The paper characterizes formal derivability in a Hoare's calculus for nondeterministic regular programs, by means of a nonstandard semantics which allows ...

Nonstandard Completeness Theorem 6.2. Let AxcLZ( ) be such that. Ax ~-- 7@ z ... about programs via nonstandard model theory, Parts I-If, TCS 17. (1982) ...

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev. Hosted as a part of SLEBOK on ...

Hoare's logic for nondeterministic regular programs: A nonstandard completeness theorem ; ISSN · 1611-3349, ; ISBN · 9783540156505 ; Year of publication · 1985.

The nonstandard approach to program semantics has successfully resolved the completeness problem of Floyd-Hoare logic. The known versions of nonstandard ...

Rodriguez-Artalejo, Hoare's logic for nondeterministic regular programs: A nonstandard completeness theorem, in: W. Brauer, ed., Prec. 12th ICALP, Lecture.

Introduction. In this paper we investigate semantic characterizations of the program verifying power of Floyd-Hoare logic of nondeterministic programs.

Hoare's logic for nondeterministic regular programs: A nonstandard completeness theorem. Automata, Languages and Programming. A compositional proof system for ...

Hoare's logic is a formalism allowing us to reason about program correctness. It was introduced fifty years ago in the seminal article [Hoa69] of Tony Hoare ...