Sciweavers

14190 search results - page 247 / 2838
» Abstractions for hybrid systems
Sort
View
CC
2004
Springer
177views System Software» more  CC 2004»
16 years 1 days ago
Value-Based Partial Redundancy Elimination
Abstract. Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) ...
Thomas VanDrunen, Antony L. Hosking
CPAIOR
2008
Springer
15 years 8 months ago
Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
Tino Teige, Martin Fränzle
ERSA
2007
194views Hardware» more  ERSA 2007»
15 years 8 months ago
A Scalable and Reconfigurable Shared-Memory Graphics Cluster Architecture
Abstract: If the computational demands of an interactive graphics rendering application cannot be met by a single commodity Graphics Processing Unit (GPU), multiple graphics accele...
Ross Brennan, Michael Manzke, Keith O'Conor, John ...
FMCAD
2008
Springer
15 years 8 months ago
Word-Level Sequential Memory Abstraction for Model Checking
el Sequential Memory Abstraction for Model Checking Per Bjesse Advanced Technology Group Synopsys Inc. Many designs intermingle large memories with wide data paths and nontrivial c...
Per Bjesse
HYBRID
2000
Springer
15 years 10 months ago
Ellipsoidal Techniques for Reachability Analysis
For the reach tube of a linear time-varying system with ellipsoidal bounds on the control variable consider the following approximation problem. Find a tight ellipsoid-valued tube...
Alexander B. Kurzhanski, Pravin Varaiya