Reliable and efficient matrix processing with the specification-consistent coordination model

The support offered by the Specification-Consistent Coordination Model (SCCM) for building reliable and efficient matrix processing programs is analyzed by comparing functional, imperative, and SCCM implementations of Floyd’s all-pairs shortest-path algorithm for dense graphs.

[1]  Lawrence C. Paulson,et al.  ML for the working programmer (2. ed.) , 1996 .

[2]  Edgar F. A. Lederer,et al.  Two-Stage Programming , 1998, Fuji International Symposium on Functional and Logic Programming.

[3]  Manuel Blum,et al.  Software reliability via run-time result-checking , 1997, JACM.

[4]  George Karypis,et al.  Introduction to Parallel Computing , 1994 .

[5]  Robert Sedgewick,et al.  Algorithms in C , 1990 .

[6]  Edgar F. A. Lederer,et al.  Specification-consistent coordination model for computations , 1998, SAC '98.