The derivation of systolic computations
From MaRDI portal
Publication:921907
DOI10.1016/0167-6423(90)90021-5zbMATH Open0709.68020OpenAlexW2158031696MaRDI QIDQ921907FDOQ921907
Authors: Anne Kaldewaij, Martin Rem 
Publication date: 1990
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6423(90)90021-5
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Distributed algorithms (68W15)
Cited In (22)
- Toward an Automatic Approach to Greedy Algorithms
- Program calculation in Coq
- Title not available (Why is that?)
- Theories for mechanical proofs of imperative programs
- Title not available (Why is that?)
- Fifty years of Hoare's logic
- A systolic design for the Aitken extrapolation formula
- Assumption propagation through annotated programs
- On building cyclic and shared structures in Haskell
- Experiments in program verification using Event-B
- 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
- Proving Quicksort Correct in Event-B
- Derivation of efficient parallel programs: An example from genetic sequence analysis
- 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)
