On the termination of program schemas

DOI10.1016/S0019-9958(75)90415-5zbMath0329.68015OpenAlexW1978809776MaRDI QIDQ4095834

A. J. Kfoury, David Park

Publication date: 1975

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(75)90415-5

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items

Non-standard algorithmic and dynamic logic, Recursive programs and denotational semantics in absolute logics of programs, Transition systems, metric spaces and ready sets in the semantics of uniform concurrency, Concurrent transition systems, An automata theoretic decision procedure for the propositional mu- calculus, Nonaxiomatisability of equivalences over finite state processes, Notes on the methodology of CCS and CSP, A proof system for the first-order relational calculus, A complete logic for reasoning about programs via nonstandard model theory. II, Modal logics for mobile processes, Some applications of topology to program semantics, Total correctness in nonstandard logics of programs, A unifying theorem for algebraic semantics and dynamic logics, Hoare's logic for nondeterministic regular programs: A nonstandard approach, Some questions about expressiveness and relative completeness in Hoare's logic, On the strength of temporal proofs