Some Properties of Predicate Transformers
Journal of the ACM (JACM)
Communications of the ACM
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Nondeterminism in logics of programs
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Arithmetical Completeness in Logics of Programs
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
A complete axiomatic system for proving deductions about recursive programs
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Computability and completeness in logics of programs (Preliminary Report)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
ICSE '76 Proceedings of the 2nd international conference on Software engineering
LOGICS OF PROGRAMS: AXIOMATICS AND DESCRIPTIVE POWER
LOGICS OF PROGRAMS: AXIOMATICS AND DESCRIPTIVE POWER
Propositional Dynamic Logic for Recursive Procedures
VSTTE '08 Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments
Hi-index | 0.00 |
The problem of reasoning about recursive programs is considered. Utilizing a simple analogy between iterative and recursive programs viewed as unfinite unions of finite terms, we carry out an investigation analogous to that carried out recently for iterative programs. The main results are the arithmetical completeness of axiom systems for (1) context-free dynamic logic and (2) its extension for dealing with infinite computations. Having the power of expression of these logics in mind, these results can be seen to supply (as corollaries) complete proof methods for the various kinds of correctness of recursive programs.