Proving properties of multidimensional recurrences with application to regular parallel algorithms

Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001

Volumn , Issue , 2001, Pages 1491-1498

  Cachera, D ^a,b   Quinton, P ^a   Rajopadhye, S ^a   Risset, T ^a  

^a CAMPUS DE BEAULIEU   (France)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

AFFINE RECURRENCE EQUATIONS; PARALLEL SYSTEM; POLYHEDRAL ANALYSIS; POLYHEDRAL TECHNIQUES; PVS THEOREM; STRUCTURED SYSTEMS; TRANSFORMATION TECHNIQUES; VERIFICATION METHOD;

THEOREM PROVING;

EID: 84981278143     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2001.925133     Document Type: Conference Paper

References (18)

1. B. Barras, S. Boutin, C. Cornes, J. Courant, J.-C. Filliâtre, E. Giménez, H. Herbelin, G. Huet, C. Muñoz, C. Murthy, C. Parent, C. Paulin-Mohring, A. Saïbi, and B. Werner. The Coq Proof Assistant Reference Manual : Version 6.1. Technical Report 0203, INRIA, Rocquencourt, France, 1997.
2. S. Bensalem, P. Caspi, C. Dumas, and C. Parent-Vigouroux. A methodology for proving control programs with Lustre and PVS. In Dependable Computing for Critical Applications, DCCA-7, San Jose. IEEE Computer Society, January 1999.
3. L. Bougé and D. Cachera. A logical framework to prove properties of Alpha programs. In Proc. Application-Specific Arrays and Processors, IEEE, pages 187-198, Zürich, Suisse, July 1997.
4. D. Cachera, S. Rajopadhye, T. Risset, and P. Quinton. Proving properties of multidimensional recurrences with application to regular parallel algorithms. Technical Report 1362, IRISA, Rennes, France, Nov. 2000.
5. P. Crégut and B. Heyd. A modular coding of unity in coq. In J. H. J. von Wright, J. Grundy, editor, Theorem Proving in Higher Order Logic, volume 1125 of Lecture Notes in Computer Science, pages 251-266, Turku, Finland, 1996. Springer-Verlag.
6. C. T. Djamegni, P. Quinton, S. Rajopadhye, and T. Risset. Derivation of systolic algorithms for the algebraic path problem by recurrence transformations. Parallel Computing, 2000. (in press).
7. F. Dupont de Dinechin. Systèmes structurés d'équations récurrentes : mise en œuvre dans le langage Alpha et applications. PhD thesis, Univ. Rennes I, France, Jan. 1997.
8. M. Gordon and A. Pitts. The HOL logic and system. In J. Bowen, editor, Towards Verified Systems, volume 2 of Real-Time Safety Critical Systems series. Elsevier, 1994.
9. R. M. Karp, R. E. Miller, and S. Winograd. The organization of computations for uniform recurrence equations. Journal of the ACM, 14(3):563-590, July 1967.
10. C. Mauras. Alpha : un langage équationnel pour la conception et la programmation d'architectures systoliques. PhD thesis, Univ. Rennes I, France, Dec. 1989.
11. S. Owre, N. Shankar, and J. M. Rushby. The PVS Specification Language. Computer Science Laboratory, SRI International, Menlo Park, CA, Feb. 1993.
12. R. Kumar, K. Schneider, and T. Kropf. Structuring and Automating Hardware Proofs in a Higher-Order Theorem-Proving Environment. International Journal of Formal System Design, pages 165-230, 1993.
13. S. Rajopadhye, T. Risset, and C. Tadonki. The algebraic path problem revisited. In Fifth International Euro-Par Conference, pages 698-707, Toulouse, France, Aug. 1999.
14. S. V. Rajopadhye. An improved systolic algorithm for the algebraic path problem. Integration: The VLSI Journal, 14(3):279-296, Feb. 1993.
15. Y. Saouter and P. Quinton. Computability of recurrence equations. Theoretical Computer Science, 116(2):317-337, 1993.
16. N. Shankar, S. Owre, and J. M. Rushby. The PVS Proof Checker: A Reference Manual. Computer Science Laboratory, SRI International, Menlo Park, CA, Feb. 1993.
17. D. Wilde. A library for doing polyhedral operations. Technical Report 785, Irisa, Rennes, France, 1993.
18. D. K. Wilde. The Alpha language. Technical Report 999, IRISA, Rennes, France, Jan. 1994.