250 search results - page 14 / 50 » Static Probabilistic Timing Analysis for Multi-path Programs |
AUTOMATICA
2008
14 years 10 months ago
2008
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
SPIN
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
101
click to vote
IFIP
1998
Springer
15 years 2 months ago
1998
Springer
This paper presents a hybrid approach to automatic parallelization of computer programs which combines static extraction of threads (tasks) with dynamic scheduling for parallel an...
100
click to vote
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
Parallelizing compiler technology has improved in recent years. One area in which compilers have made progress is in handling DOACROSS loops, where crossprocessor data dependencie...
105
click to vote
ICFP
2002
ACM
15 years 10 months ago
2002
ACM
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...