The following pages link to (Q3995530):
Displaying 23 items.
- On invariant checking (Q394493) (← links)
- Verification conditions for source-level imperative programs (Q465685) (← links)
- Weakly expressive models for Hoare logic (Q805248) (← links)
- Algebras of modal operators and partial correctness (Q820135) (← links)
- \textit{Theorema}: Towards computer-aided mathematical theory exploration (Q865646) (← links)
- Equational reasoning about nondeterministic processes (Q911801) (← links)
- Using computer algebra techniques for the specification, verification and synthesis of recursive programs (Q1025311) (← links)
- Inductive assertion method for logic pograms (Q1105352) (← links)
- Design and verification of fault tolerant systems with CSP (Q1176076) (← links)
- On a generalized product for domains (Q1311968) (← links)
- On the mechanical derivation of loop invariants (Q1322851) (← links)
- The verification of modules (Q1329200) (← links)
- Stability, sequentiality and demand driven evaluation in dataflow (Q1346605) (← links)
- Improved method to generate path-wise test data (Q1429440) (← links)
- Specification and verification of object-oriented programs using supertype abstraction (Q1902305) (← links)
- Non-terminating processes in the situation calculus (Q2188782) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- Mechanical Software Verification (Q2841237) (← links)
- Term rewriting systems with sort priorities (Q4876348) (← links)
- First order data types and first order logic (Q5096240) (← links)
- A Relation-Algebraic Treatment of the Dedekind Recursion Theorem (Q5098710) (← links)
- Termination, deadlock and divergence (Q5887521) (← links)
- Indexed and fibered structures for partial and total correctness assertions (Q5889306) (← links)
