A computational logic handbook
A computational logic handbook
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Hypercube algorithms: with applications to image processing and pattern recognition
Hypercube algorithms: with applications to image processing and pattern recognition
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
On the Conversion Between Binary Code and Binary-Reflected Gray Code on Binary Cubes
IEEE Transactions on Computers
Finding shape numbers in parallel
Pattern Recognition Letters
MPI: The Complete Reference
Automated Reasoning About Parallel Algorithms Using Powerlists
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Induction-Oriented Formal Verification in Symmetric Interconnection Networks
CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
An Experiment in Parallelizing an Application Using Formal Methods
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
| Hi-index | 0.00 |
In recent times we have seen a growing interest in the development of parallel programs. The hypercube architecture has been used extensively and specific parallel algorithms have been developed e.g., in the fields of computer vision or signal processing. However few solutions have been proposed to formally validate this kind of program. We have developed a methodology for the formal verification of applications distributed on symmetric networks like the hypercube. It is based on a representation of the networks in terms of Cayley graphs and uses theorem proving techniques. We describe the application of this method to the validation of a parallel algorithm coming from the area of image processing: it computes "shape numbers" and uses the embedding of a ring into a hypercube.