The following pages link to (Q3899466):
Displaying 50 items.
- Specifying termination in CSP (Q407510) (← links)
- Verification of object-oriented programs: a transformational approach (Q439944) (← links)
- ASM refinement and generalizations of forward simulation in data refinement: a comparison (Q555790) (← links)
- An axiomatic treatment of SIMD assignment (Q583875) (← links)
- Formal semantics for mutual belief (Q685541) (← links)
- A fixed point approach to parallel discrete event simulation (Q758225) (← links)
- Wythoff games, continued fractions, cedar trees and Fibonacci searches (Q761983) (← links)
- A weakest precondition semantics for communicating processes (Q789174) (← links)
- Proving program inclusion using Hoare's logic (Q789887) (← links)
- Correctness of programs with Pascal-like procedures without global variables (Q790607) (← links)
- Two theorems about the completeness of Hoare's logic (Q794426) (← links)
- Average case optimality for linear problems (Q796299) (← links)
- Expressiveness and the completeness of Hoare's logic (Q800082) (← links)
- The axiomatic semantics of programs based on Hoare's logic (Q800712) (← links)
- Equivalences among logics of programs (Q801684) (← links)
- Results on the propositional \(\mu\)-calculus (Q801893) (← links)
- Weakly expressive models for Hoare logic (Q805248) (← links)
- Closure functions and general iterates as reflectors (Q808275) (← links)
- Semantics of plan revision in intelligent agents (Q820137) (← links)
- Extending separation logic with fixpoints and postponed substitution (Q820139) (← links)
- Command algebras, recursion and program transformation (Q911748) (← links)
- Proving total correctness of recursive procedures (Q913478) (← links)
- Semantical analysis of specification logic (Q913527) (← links)
- On the completeness of modular proof systems (Q917327) (← links)
- A first order logic for partial functions (Q918965) (← links)
- Proof obligations for blocks and procedures (Q919838) (← links)
- A mechanical analysis of program verification strategies (Q928673) (← links)
- Alternating states for dual nondeterminism in imperative programming (Q974118) (← links)
- The axiomatization of override and update (Q975885) (← links)
- Dual unbounded nondeterminacy, recursion, and fixpoints (Q995749) (← links)
- On infinite computations in denotational semantics (Q1051414) (← links)
- Programs as proofs: A synopsis (Q1051424) (← links)
- An algebraic approach to the syntax and semantics of languages with subscripted variables (Q1053444) (← links)
- Hoare's logic for programming languages with two data types (Q1056220) (← links)
- Ten years of Hoare's logic: A survey. II: Nondeterminism (Q1056534) (← links)
- Specification-oriented semantics for communicating processes (Q1060838) (← links)
- Merging regular processes by means of fixed-point theory (Q1082070) (← links)
- Infinite streams and finite observations in the semantics of uniform concurrency (Q1091800) (← links)
- Applications of compactness in the Smyth powerdomain of streams (Q1107301) (← links)
- Interpretations of recursion under unbounded nondeterminacy (Q1115173) (← links)
- Hiding in stream semantics of uniform concurrency (Q1120267) (← links)
- The \(\mu\)-calculus as an assertion-language for fairness arguments (Q1124314) (← links)
- On correct refinement of programs (Q1157144) (← links)
- Floyd's principle, correctness theories and program equivalence (Q1158948) (← links)
- A dual problem to least fixed points (Q1160150) (← links)
- Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs (Q1163369) (← links)
- Fixed point theorems and semantics: A folk tale (Q1166268) (← links)
- Hoare's logic and Peano's arithmetic (Q1170877) (← links)
- A continuous semantics for unbounded nondeterminism (Q1171370) (← links)
- Domain theory in logical form (Q1174593) (← links)
