Sciweavers

1291 search results - page 73 / 259
» Arithmetic program paths
Sort
View
SAC
2010
ACM
14 years 4 months ago
Variable ranges in linear constraints
We introduce an extension of linear constraints, called linearrange constraints, which allows for (meta-)reasoning about the approximation width of variables. Semantics for linear...
Salvatore Ruggieri, Fred Mesnard
SPIN
2009
Springer
14 years 4 months ago
Symbolic Analysis via Semantic Reinterpretation
Abstract. The paper presents a novel technique to create implementations of the basic primitives used in symbolic program analysis: forward symbolic evaluation, weakest liberal pre...
Junghee Lim, Akash Lal, Thomas W. Reps
FMCO
2005
Springer
153views Formal Methods» more  FMCO 2005»
14 years 3 months ago
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
Abstract. Separation logic is a program logic for reasoning about programs that manipulate pointer data structures. We describe Smallfoot, a tool for checking certain lightweight s...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
PDPTA
2000
13 years 11 months ago
Constant Multipliers for FPGAs
This paper presents a survey of techniques to implement multiplications by constants on FPGAs. It shows in particular that a simple and well-known technique, canonical signed recod...
Florent de Dinechin, Vincent Lefèvre
DGCI
2006
Springer
14 years 1 months ago
Recognition of Blurred Pieces of Discrete Planes
We introduce a new discrete primitive, the blurred piece of a discrete plane, which relies on the arithmetic definition of discrete planes. It generalizes such planes, admitting th...
Laurent Provot, Lilian Buzer, Isabelle Debled-Renn...