The following pages link to (Q3925859):
Displaying 50 items.
- Non-deterministic expressions and predicate transformers (Q287006) (← links)
- Weakest preconditions for pure Prolog programs (Q293340) (← links)
- A versatile concept for the analysis of loops (Q444373) (← links)
- Deriving dense linear algebra libraries (Q469358) (← links)
- Polynomial-time inverse computation for accumulative functions with multiple data traversals (Q526439) (← links)
- Auxiliary variables in partial correctness programming logics (Q582037) (← links)
- An axiomatic treatment of SIMD assignment (Q583875) (← links)
- Reflexive transitive invariant relations: A basis for computing loop functions (Q604384) (← links)
- An elementary and unified approach to program correctness (Q607408) (← links)
- Structural operational semantics through context-dependent behaviour (Q638568) (← links)
- Predicate transformers and higher-order programs (Q672318) (← links)
- Term rewriting and Hoare logic -- Coded rewriting (Q673226) (← links)
- Constructing a program with exceptions (Q674271) (← links)
- Games and winning strategies (Q674272) (← links)
- Calculating with procedure calls (Q685524) (← links)
- Loop invariants in floating point algorithms (Q685861) (← links)
- Adas and the equational theory of if-then-else (Q690107) (← links)
- Provably correct derivation of algorithms using FermaT (Q736840) (← links)
- Program inversion in the refinement calculus (Q750160) (← links)
- The derivation of a tighter bound for top-down skew heaps (Q751283) (← links)
- Data types over multiple-valued logics (Q752687) (← links)
- P-A logic - a compositional proof system for distributed programs (Q757079) (← links)
- Opportunistic algorithms for eliminating supersets (Q758205) (← links)
- Synthetic programming (Q761788) (← links)
- A logic covering undefinedness in program proofs (Q790610) (← links)
- Strongest invariant functions: Their use in the systematic analysis of while statements (Q797985) (← links)
- Application of the trace assertion method to the specification, design, and verification of automaton programs (Q840086) (← links)
- On the longest increasing subsequence of a circular list (Q845894) (← links)
- Verification conditions are code (Q855274) (← links)
- Fundamentals of reversible flowchart languages (Q896906) (← links)
- CASOP: A fast algorithm for computing the \(n\)-ary composition of a binary associative operator (Q910217) (← links)
- Do-it-yourself type theory (Q911744) (← links)
- Command algebras, recursion and program transformation (Q911748) (← links)
- The algebra of conditional logic (Q913791) (← links)
- Refinement concepts formalised in higher order logic (Q916409) (← links)
- Derivation of efficient parallel programs: An example from genetic sequence analysis (Q916411) (← links)
- A first order logic for partial functions (Q918965) (← links)
- Enabledness and termination in refinement algebra (Q923890) (← links)
- Applying relation algebra and RelView to solve problems on orders and lattices (Q929300) (← links)
- Embedding mappings and splittings with applications (Q968275) (← links)
- A problem reduction based approach to discrete optimization algorithm design (Q975314) (← links)
- Mathematics for reasoning about loop functions (Q1044182) (← links)
- Programs as proofs: A synopsis (Q1051424) (← links)
- A presentation of the Fibonacci algorithm (Q1057303) (← links)
- On the decomposition of sequences into ascending subsequences (Q1064072) (← links)
- Equivalence of the Gries and Martin proof rules for procedure calls (Q1065535) (← links)
- A categorical treatment of pre- and post-conditions (Q1093363) (← links)
- The formal development of a parallel program performing LU-decomposition (Q1096311) (← links)
- A sharp proof rule for procedures in WP semantics (Q1104730) (← links)
- Generation of convex polygons with individual angular constraints (Q1107995) (← links)
