Sciweavers

42 search results - page 8 / 9
» Widening Arithmetic Automata
Sort
View
CAV
2003
Springer
107views Hardware» more  CAV 2003»
14 years 19 days ago
Theorem Proving Using Lazy Proof Explication
Many verification problems reduce to proving the validity of formulas involving both propositional connectives and domain-specific functions and predicates. This paper presents ...
Cormac Flanagan, Rajeev Joshi, Xinming Ou, James B...
TACAS
2009
Springer
144views Algorithms» more  TACAS 2009»
13 years 12 months ago
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
Christoph Scholl, Stefan Disch, Florian Pigorsch, ...
ENTCS
2008
146views more  ENTCS 2008»
13 years 7 months ago
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
Michael J. A. Smith
CEC
2008
IEEE
14 years 1 months ago
Generating massive high-quality random numbers using GPU
— Pseudo-random number generators (PRNG) have been intensively used in many stochastic algorithms in artificial intelligence, computer graphics and other scientific computing. ...
Wai-Man Pang, Tien-Tsin Wong, Pheng-Ann Heng
PODC
2004
ACM
14 years 25 days ago
Computation in networks of passively mobile finite-state sensors
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
Dana Angluin, James Aspnes, Zoë Diamadi, Mich...