Sciweavers

289 search results - page 8 / 58
» Program transformation by templates based on term rewriting
Sort
View
ECEASST
2006
96views more  ECEASST 2006»
13 years 7 months ago
Optimizing Pattern Matching Compilation by Program Transformation
Motivated by the promotion of rewriting techniques and their use in major industrial applications, we have designed Tom: a pattern matching layer on top of conventional programming...
Emilie Balland, Pierre-Etienne Moreau
TSMC
2010
13 years 2 months ago
Cancelable Templates for Sequence-Based Biometrics with Application to On-line Signature Recognition
Recent years have seen the rapid spread of biometric technologies for automatic people recognition. However, security and privacy issues still represent the main obstacles for the ...
Emanuele Maiorana, Patrizio Campisi, Julian Fi&eac...
IEICET
2007
110views more  IEICET 2007»
13 years 7 months ago
A Higher-Order Knuth-Bendix Procedure and Its Applications
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
Keiichirou Kusakari, Yuki Chiba
CASES
2010
ACM
13 years 5 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau
XSYM
2004
Springer
89views Database» more  XSYM 2004»
14 years 21 days ago
A Runtime System for XML Transformations in Java
We show that it is possible to extend a general-purpose programming language with a convenient high-level data-type for manipulating XML documents while permitting (1) precise stat...
Aske Simon Christensen, Christian Kirkegaard, Ande...