Formal Derivation of Divide-and-Conquer Programs: A Case Study in the Multidimensional FFT's (1997)

by Sergei Gorlatch , Holger Bischof
Venue:Formal Methods for Parallel Programming: Theory and Applications. Workshop at IPPS'97
Citations:5 - 3 self

Documents Related by Co-Citation

69 Foundations of Parallel Programming – D Skillicorn - 1994
1312 Monads for functional programming – Philip Wadler - 1995
27 Systematic Efficient Parallelization of Scan and Other List Homomorphisms – Sergei Gorlatch - 1996
17 Systematic Extraction and Implementation of Divide-and-Conquer Parallelism – Sergei Gorlatch - 1996
55 Algorithmic skeletons: a structured approach to the management of parallel computation – M I Cole - 1988
59 Powerlist: a structure for parallel recursion – Jayadev Misra - 1994
2 Mechanized inductive proof of properties of a simple code optimizer – Alfons Geser - 1995
5 Towards a set of inference rules for solving divergence in Knuth-Bendix completion – S Lange - 1989
14 Deriving associative operators for language recognition – D Barnard, J Schmeiser, D Skillicorn - 1991
12 Constructing list homomorphisms – S Gorlatch - 1995
8 Lemma discovery by anti-unification of regular sorts – B Heinz - 1994
3 Term induction proofs by a generalization of narrowing – Ulrich Fraus, Heinrich Humann - 1992
5 Syntactic theories – J-P Jouannaud - 1990
12 A correctness proof of parallel scan – John O’Donnell - 1994
24 The Third Homomorphism Theorem – Jeremy Gibbons, Jeremy Gibbons - 1995
5 Lattice-Theoretic Properties of Subsumption. Memo MIP-R-77 – G Plotkin - 1970
7 Solving divergence in Knuth-Bendix completion by enriching signatures – M Thomas, P Watson - 1993
10 shallow theories – cycle-syntacticness Syntacticness - 1994
117 Canonical Equational Proofs – L Bachmair - 1991