the LINPACK benchmark: an explanation
Proceedings of the 1st International Conference on Supercomputing
Program Concept Recognition and Transformation
IEEE Transactions on Software Engineering - Special issue on software maintenance
Automated program recognition by graph parsing
Automated program recognition by graph parsing
A specification driven slicing process for identifying reusable functions
Journal of Software Maintenance: Research and Practice
Advanced compiler design and implementation
Advanced compiler design and implementation
Automatic algorithm recognition and replacement: a new approach to program optimization
Automatic algorithm recognition and replacement: a new approach to program optimization
Basic Linear Algebra Subprograms for Fortran Usage
ACM Transactions on Mathematical Software (TOMS)
SPL: a language and compiler for DSP algorithms
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
On the Equivalence of Two Systems of Affine Recurrence Equations (Research Note)
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
PAP Recognizer: A Tool for Automatic Recognition of Parallelizable Patterns
WPC '96 Proceedings of the 4th International Workshop on Program Comprehension (WPC '96)
Algorithm Recognition based on Demand-Driven Data-flow Analysis
WCRE '03 Proceedings of the 10th Working Conference on Reverse Engineering
LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation
Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
Spiral: A Generator for Platform-Adapted Libraries of Signal Processing Algorithms
International Journal of High Performance Computing Applications
Tree acceptors and some of their applications
Journal of Computer and System Sciences
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Iterative compilation with kernel exploration
LCPC'06 Proceedings of the 19th international conference on Languages and compilers for parallel computing
| Hi-index | 0.00 |
Domain-specific languages (DSL) provides high-level functions making applications easier to write, and to maintain. Unfortunately, many applications are written from scratch and poorly documented, which make them hard to maintain. An ideal solution should be to rewrite them in a appropriate DSL. In this paper, we present TeMa (Template Matcher), an automatic tool to recognize high-level functions in source code. Preliminary results show how TeMa can be used to reformulate Fortran code into Signal Processing Language (SPL) used in SPIRAL. This opens new possibilities for domain-specific languages.