Recommendations
Cited in
(22)- Toward an Automatic Approach to Greedy Algorithms
- Program calculation in Coq
- Theories for mechanical proofs of imperative programs
- scientific article; zbMATH DE number 47855 (Why is no real title available?)
- scientific article; zbMATH DE number 1760065 (Why is no real title available?)
- A systolic design for the Aitken extrapolation formula
- Fifty years of Hoare's logic
- Experiments in program verification using Event-B
- On building cyclic and shared structures in Haskell
- Assumption propagation through annotated programs
- Combining top-down and bottom-up techniques in program derivation
- An elementary and unified approach to program correctness
- The co-invariant generator: An aid in deriving loop bodies
- Verification conditions for source-level imperative programs
- A systolic design for acceptors of regular languages
- Two small parallel programming exercises
- Proof rules for recursive procedures
- Derivation of efficient parallel programs: An example from genetic sequence analysis
- Proving Quicksort Correct in Event-B
- Rank order filters and priority queues
- Elimination Techniques for Program Analysis
- On designing stacked canons with relative chord tones
This page was built for publication: The derivation of systolic computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q921907)