Sciweavers

309 search results - page 40 / 62
» A Comparative Revisitation of Some Program Transformation Te...
Sort
View
EMSOFT
2008
Springer
14 years 11 months ago
Volatiles are miscompiled, and what to do about it
C's volatile qualifier is intended to provide a reliable link between operations at the source-code level and operations at the memorysystem level. We tested thirteen product...
Eric Eide, John Regehr
74
Voted
ERSHOV
2009
Springer
15 years 4 months ago
Proving the Equivalence of Higher-Order Terms by Means of Supercompilation
One of the applications of supercompilation is proving properties of programs.We focus in this paper on a speci c task: proving term equivalence for a higher-order lazy functiona...
Ilya Klyuchnikov, Sergei A. Romanenko
65
Voted
SAS
1994
Springer
105views Formal Methods» more  SAS 1994»
15 years 1 months ago
Efficient Strictness Analysis of Haskell
Strictness analysis has been a living field of investigation since Mycroft's original work in 1980, and is getting increasingly significant with the still wider use of lazy fu...
Kristian Damm Jensen, Peter Hjæresen, Mads R...
106
Voted
SAC
2009
ACM
15 years 2 months ago
Aspect-oriented procedural content engineering for game design
Generally progressive procedural content in the context of 3D scene rendering is expressed as recursive functions where a finer level of detail gets computed on demand. Typical e...
Walter Cazzola, Diego Colombo, Duncan Harrison
102
Voted
DM
2006
128views more  DM 2006»
14 years 9 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck