Sciweavers

1291 search results - page 9 / 259
» Arithmetic program paths
Sort
View
CADE
2006
Springer
14 years 7 months ago
Solving Sparse Linear Constraints
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
Shuvendu K. Lahiri, Madanlal Musuvathi
ASPDAC
2007
ACM
101views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Robust Analog Circuit Sizing Using Ellipsoid Method and Affine Arithmetic
-- Analog circuit sizing under process/parameter variations is formulated as a mini-max geometric programming problem. To tackle such problem, we present a new method that combines...
Xuexin Liu, Wai-Shing Luk, Yu Song, Pushan Tang, X...
FSTTCS
2006
Springer
13 years 11 months ago
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
Gary Wassermann, Zhendong Su
ASAP
2004
IEEE
140views Hardware» more  ASAP 2004»
13 years 11 months ago
Decimal Floating-Point Division Using Newton-Raphson Iteration
Decreasing feature sizes allow additional functionality to be added to future microprocessors to improve the performance of important application domains. As a result of rapid gro...
Liang-Kai Wang, Michael J. Schulte
CAV
2009
Springer
164views Hardware» more  CAV 2009»
14 years 7 months ago
InvGen: An Efficient Invariant Generator
Abstract. In this paper we present InvGen, an automatic linear arithmetic invariant generator for imperative programs. InvGen's unique feature is in its use of dynamic analysi...
Ashutosh Gupta, Andrey Rybalchenko