On the termination of program schemas

DOI10.1016/S0019-9958(75)90415-5MaRDI QIDQ4095834zbMATH OpenOpenAlexFDO

Authors Assaf 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)

Cited in

(16)

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

This page was built for publication: On the termination of program schemas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4095834)