Sciweavers

71 search results - page 11 / 15
» Correct rounding of algebraic functions
Sort
View
TPHOL
2000
IEEE
15 years 1 months ago
Equational Reasoning via Partial Reflection
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
PLDI
2011
ACM
14 years 13 days ago
Data representation synthesis
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...
FFA
2007
62views more  FFA 2007»
14 years 9 months ago
On the parameters of r-dimensional toric codes
From a rational convex polytope of dimension r ≥ 2 J.P. Hansen constructed an error correcting code of length n = (q−1)r over the finite field Fq. A rational convex polytope...
Diego Ruano
ICDE
2005
IEEE
101views Database» more  ICDE 2005»
15 years 3 months ago
Optimization of Nested XQuery Expressions with Orderby Clauses
— XQuery, the defacto XML query language, is a functional language with operational semantics, which precludes the direct application of classical query optimization techniques. ...
Song Wang, Elke A. Rundensteiner, Murali Mani
77
Voted
CORR
2008
Springer
97views Education» more  CORR 2008»
14 years 9 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett