Sciweavers

52 search results - page 4 / 11
» The Verus Language: Representing Time Efficiently with BDDs
Sort
View
DAC
2004
ACM
14 years 9 months ago
A SAT-based algorithm for reparameterization in symbolic simulation
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...
Pankaj Chauhan, Edmund M. Clarke, Daniel Kroening
CASES
2004
ACM
14 years 10 days ago
Providing time- and space- efficient procedure calls for asynchronous software thread integration
Asynchronous Software Thread Integration (ASTI) provides fine-grain concurrency in real-time threads by statically scheduling (integrating) code from primary threads into secondar...
Vasanth Asokan, Alexander G. Dean
DLS
2010
204views Languages» more  DLS 2010»
13 years 6 months ago
Alias analysis for optimization of dynamic languages
Dynamic languages such as Python allow programs to be written more easily using high-level constructs such as comprehensions for queries and using generic code. Efficient executio...
Michael Gorbovitski, Yanhong A. Liu, Scott D. Stol...
COLING
2010
13 years 3 months ago
Efficient Statement Identification for Automatic Market Forecasting
Strategic business decision making involves the analysis of market forecasts. Today, the identification and aggregation of relevant market statements is done by human experts, oft...
Henning Wachsmuth, Peter Prettenhofer, Benno Stein
JSA
2000
175views more  JSA 2000»
13 years 8 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd