Sciweavers

556 search results - page 44 / 112
» Checking Interval Properties of Computations
Sort
View
ENDM
2010
86views more  ENDM 2010»
15 years 4 months ago
Mathematical programming based debugging
Verifying that a piece of software has no bugs means proving that it has certain desired properties, such as an array index not taking values outside certain Abstract interpretati...
Leo Liberti, Stéphane Le Roux, Jeremy Lecon...
SAC
2010
ACM
15 years 11 months ago
Polytope-based computation of polynomial ranges
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
Christoph Fünfzig, Dominique Michelucci, Sebt...
CDC
2008
IEEE
149views Control Systems» more  CDC 2008»
15 years 6 months ago
Distributed computation under bit constraints
Abstract-- A network of nodes communicate via noisy channels. Each node has some real-valued initial measurement or message. The goal of each of the nodes is to acquire an estimate...
Ola Ayaso, Devavrat Shah, Munther A. Dahleh
LMCS
2006
79views more  LMCS 2006»
15 years 4 months ago
Computably Based Locally Compact Spaces
tract Stone Duality) is a re-axiomatisation of general topology in which the topology on a space is treated, not as an infinitary lattice, but as an exponential object of the same...
Paul Taylor 0002
CAV
2007
Springer
108views Hardware» more  CAV 2007»
15 years 10 months ago
Systematic Acceleration in Regular Model Checking
Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular ...
Bengt Jonsson, Mayank Saksena