Sciweavers

1291 search results - page 48 / 259
» Arithmetic program paths
Sort
View
SAC
2006
ACM
14 years 2 months ago
Provably faithful evaluation of polynomials
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ...
Sylvie Boldo, César Muñoz
CC
2001
Springer
131views System Software» more  CC 2001»
14 years 1 months ago
Compiler Transformation of Pointers to Explicit Array Accesses in DSP Applications
Abstract. Efficient implementation of DSP applications are critical for embedded systems. However, current applications written in C, make extensive use of pointer arithmetic maki...
Björn Franke, Michael F. P. O'Boyle
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
13 years 9 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia
TAP
2010
Springer
145views Hardware» more  TAP 2010»
13 years 6 months ago
QuickSpec: Guessing Formal Specifications Using Testing
We present QuickSpec, a tool that automatically generates algebraic specifications for sets of pure functions. The tool is based on testing, rather than static analysis or theorem ...
Koen Claessen, Nicholas Smallbone, John Hughes
WLP
2005
Springer
14 years 1 months ago
Meta-S - Combining Solver Cooperation and Programming Languages
Abstract. Meta-S is a constraint solver cooperation system which allows the dynamic integration of arbitrary external (stand-alone) solvers and their combination with declarative l...
Stephan Frank, Petra Hofstedt, Dirk Reckmann