Formal derivation of parallel program for 2-dimensional maximum segment sum problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1123, Issue , 1996, Pages 553-562

  Hu, Zhenjiang ^a   Iwasaki, Hideya ^b   Takeichi, Masato ^a  

^a UNIVERSITY OF TOKYO   (Japan)

^b TOKYO UNIVERSITY OF AGRICULTURE AND TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL PROGRAMMING;

DIVIDE AND CONQUER; FORMAL DERIVATION; FORMAL DEVELOPMENT; LIST-HOMOMORPHISMS; PARALLEL PROGRAM; RECURSIVE STRUCTURE; TUPLING;

ALGEBRA;

EID: 84955588560     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61626-8_75     Document Type: Conference Paper

References (6)

1. R. Bird. An introduction to the theory of lists. In M. Broy, editor, Logic of Programming and Calculi of Discrete Design, pages 5-42. Springer-Verlag, 1987.
2. M. Cole. List homomorphic parallel algorithms for bracket matching. Technical report CSR-29-93, Department of Computing Science, The University of Edinburgh, August 1993.
3. M. Cole. Parallel programming, list homomorphisms and the maximum segment sum problems. Report CSR-25-93, Department of Computing Science, The University of Edinburgh, May 1993.
4. W. Cai and D.B. Skillicorn. Calculating recurrences using the Bird-Meertens Formalism. Technical report, Department of Computing and Information Science, Queen’s University, 1992.
5. Z. Hu, H. Iwasaki, and M. Takeichi. Construction of list homomorphisms via tupling and fusion. In 21st International Symposium on Mathematical Foundation of Computer Science (MFCS’96), Cracow, September 1996. Springer-Verlag Lecture Notes in Computer Science.
6. D.R. Smith. Applications of a strategy for designing divide-and-conquer algorithms. Science of Computer Programming, (9):213-229, 1987.