Sciweavers

2018 search results - page 18 / 404
» Code Normal Forms
Sort
View
POPL
1997
ACM
14 years 1 months ago
Call by Need Computations to Root-Stable Form
The following theorem of Huet and L
Aart Middeldorp
ICIP
2005
IEEE
14 years 11 months ago
An efficient algorithm for informed embedding of dirty-paper trellis codes for watermarking
Dirty paper trellis codes are a form of watermarking with side information. These codes have the advantage of being invariant to valumetric scaling of the cover Work. However, the...
Gwenaël J. Doërr, Ingemar J. Cox, Lin Li...
PEPM
1998
ACM
14 years 2 months ago
Type-Directed Partial Evaluation
Abstract. We use a code generator--type-directed partial evaluation-to verify conversions between isomorphic types, or more precisely to verify that a composite function is the ide...
Olivier Danvy
ENTCS
2008
110views more  ENTCS 2008»
13 years 10 months ago
A New Proposal Of Quasi-Solved Form For Equality Constraint Solving
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
Javier Álvez, Paqui Lucio
WCRE
2010
IEEE
13 years 8 months ago
From Whence It Came: Detecting Source Code Clones by Analyzing Assembler
To date, most clone detection techniques have concentrated on various forms of source code analysis, often by analyzing token streams. In this paper, we introduce a complementary ...
Ian J. Davis, Michael W. Godfrey