1291 search results - page 73 / 259 » Arithmetic program paths |
146
click to vote
SAC
2010
ACM
15 years 11 months ago
2010
ACM
We introduce an extension of linear constraints, called linearrange constraints, which allows for (meta-)reasoning about the approximation width of variables. Semantics for linear...
137
click to vote
SPIN
2009
Springer
15 years 11 months ago
2009
Springer
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...
164
Voted
FMCO
2005
Springer
15 years 10 months ago
2005
Springer
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...
128
click to vote
PDPTA
2000
15 years 6 months ago
2000
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...
137
click to vote
DGCI
2006
Springer
15 years 8 months ago
2006
Springer
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...