Sciweavers

797 search results - page 86 / 160
» MODULA-2 and Its Compilation
Sort
View
SIGMOD
2009
ACM
142views Database» more  SIGMOD 2009»
16 years 4 months ago
A grammar-based entity representation framework for data cleaning
Fundamental to data cleaning is the need to account for multiple data representations. We propose a formal framework that can be used to reason about and manipulate data represent...
Arvind Arasu, Raghav Kaushik
ICFP
2007
ACM
16 years 4 months ago
Stream fusion: from lists to streams to nothing at all
This paper presents an automatic deforestation system, stream fusion, based on equational transformations, that fuses a wider range of functions than existing short-cut fusion sys...
Duncan Coutts, Roman Leshchinskiy, Don Stewart
IPPS
2009
IEEE
15 years 11 months ago
Compiler-enhanced incremental checkpointing for OpenMP applications
As modern supercomputing systems reach the peta-flop performance range, they grow in both size and complexity. This makes them increasingly vulnerable to failures from a variety ...
Greg Bronevetsky, Daniel Marques, Keshav Pingali, ...
HASKELL
2009
ACM
15 years 11 months ago
Types are calling conventions
It is common for compilers to derive the calling convention of a function from its type. Doing so is simple and modular but misses many optimisation opportunities, particularly in...
Maximilian C. Bolingbroke, Simon L. Peyton Jones
DATE
2008
IEEE
182views Hardware» more  DATE 2008»
15 years 11 months ago
An adaptable FPGA-based System for Regular Expression Matching
In many applications string pattern matching is one of the most intensive tasks in terms of computation time and memory accesses. Network Intrusion Detection Systems and DNA Seque...
Ivano Bonesana, Marco Paolieri, Marco D. Santambro...