On the Recognition of Algorithm Templates

Electronic Notes in Theoretical Computer Science

Volumn 82, Issue 2, 2004, Pages 395-409

  Alias, Christophe ^a   Barthou, Denis ^a  

^a LABORATOIRE DES SCIENCES DU CLIMAT ET DE L ENVIRONNEMENT   (France)

Author keywords

Algorithm recognition; Preliminary approach; SARE; Templates; Unification

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER SIMULATION; CONTEXT FREE GRAMMARS; ERROR STATISTICS; FUNCTIONS; MATHEMATICAL MODELS;

ALGORITHM RECOGNITION; PRELIMINARY APPROACH; SARE; TEMPLATES; UNIFICATION;

COMPUTER SYSTEMS;

EID: 18744364697     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)82599-X     Document Type: Conference Paper

References (18)

1. Autebert J.-M., Berstel J., Boasson L. Context-free languages and pushdown automata. Handbook of Formal Languages. 1997;Springer Verlag
2. Baader F., Nipkow T. "Term Rewriting and all that," 1998;Cambridge University Press
3. Barthou D., Feautrier P., Redon X. On the equivalence of two systems of affine recurrence equations. Technical Report RR-4285, INRIA. 2001
4. Barthou D., Feautrier P., Redon X. On the equivalence of two systems of affine recurrence equations. 8th International Euro-Par Conference. 2002;309
5. Darte A., Robert Y., Vivien F. "Scheduling and automatic Parallelization," 2000;Birkhäuser
6. Feautrier P. Dataflow analysis of scalar and array references. Int. J. of Parallel Programming. 20:1991;23-53
7. Feautrier P. Some efficient solutions to the affine scheduling problem, II, multidimensional time. Int. J. of Parallel Programming. 21:1992;389-420
8. Hermann M., Galbavý R. Unification of infinite sets of terms schematized by primal grammars. Theoretical Computer Science. 176:1997;111-158
9. Huet G. A unification algorithm for typed Λ-calculus. Theoretical Computer Science. 1:1975;27-57
10. Kelly W., Pugh W., Rosser E., Shpeisman T. Transitive closure of infinite graphs and its applications. Int. J. of Parallel Programming. 24:1996;579-598
11. Lee L.-Q., Siek J.G., Lumsdaine A. The generic graph component library. Proceedings of the Conference on Object-Oriented Programming, Systems, Languages, and Applications. 1999;399-414
12. Metzger R., Wen Z. "Automatic Algorithm Recognition: A New Approach to Program Optimization," 2000;MIT Press
13. Redon X., Feautrier P. Detection of scans in the polytope model. Parallel Algorithms and Applications. 15:2000;229-263
14. Saouter Y., Quinton P. Computability of recurrence equations. TCS. 116:1993;317-337
15. Shashidhar K., Bruynooghe M., Catthoor F., Janssens G. Geometric model checking: An automatic verification technique for loop and data reuse transformations. International Workshop on Compilers Optimization Meets Compiler Verification, ENTCS. 65:2002
16. Siek J.G., Lumsdaine A. The matrix template library: A generic programming approach to high performance numerical linear algebra. ISCOPE. 1998;59-70
17. TayouDjameni C., Quinton P., Rajopadhye S., Risset T. Derivation of systolic algorithm path problem by recurrence transformations. Parallel Computing. 2000
18. Wills L.M. Using Attributed Flow Graph Parsing to Recognize Cliches in Programs. Proc. 5th Int. Workshop on Graph Grammars and their Application to Computer Science, LNCS. 1073:1996;170-184