Sciweavers

72 search results - page 7 / 15
» Decision diagrams for linear arithmetic
Sort
View
LPAR
2010
Springer
13 years 5 months ago
Interpolating Quantifier-Free Presburger Arithmetic
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...
Daniel Kroening, Jérôme Leroux, Phili...
CAV
2007
Springer
116views Hardware» more  CAV 2007»
14 years 1 months ago
A Decision Procedure for Bit-Vectors and Arrays
Abstract. STP is a decision procedure for the satisfiability of quantifier-free formulas in the theory of bit-vectors and arrays that has been optimized for large problems encoun...
Vijay Ganesh, David L. Dill
ISMVL
2007
IEEE
94views Hardware» more  ISMVL 2007»
14 years 1 months ago
Representations of Elementary Functions Using Edge-Valued MDDs
This paper proposes a method to represent elementary functions such as trigonometric, logarithmic, square root, and reciprocal functions using edge-valued multi-valued decision di...
Shinobu Nagayama, Tsutomu Sasao
RISE
2004
Springer
14 years 21 days ago
A Symbolic Model Checker for tccp Programs
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
María Alpuente, Moreno Falaschi, Alicia Vil...
DATE
2000
IEEE
108views Hardware» more  DATE 2000»
13 years 11 months ago
Automatic Abstraction for Worst-Case Analysis of Discrete Systems
c Abstraction for Worst-Case Analysis of Discrete Systems Felice Balarin Cadence Berkeley Laboratories Recently, a methodology for worst-case analysis of discrete systems has been...
Felice Balarin