39 search results - page 3 / 8 » SPEED: Symbolic Complexity Bound Analysis |
SIGSOFT
2003
ACM
14 years 6 months ago
2003
ACM
Memory corruption errors lead to non-deterministic, elusive crashes. This paper describes ARCHER (ARray CHeckER) a static, effective memory access checker. ARCHER uses path-sensit...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
HIPEAC
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. While cycle-accurate simulation tools have been widely used in modeling high-performance processors, such an approach can be hindered by the increasing complexity of the ...
QEST
2010
IEEE
13 years 3 months ago
2010
IEEE
The method of stochastic state classes approaches the analysis of Generalised Semi Markov Processes (GSMP) through symbolic derivation of probability density functions over Differe...
ICCD
1995
IEEE
13 years 9 months ago
1995
IEEE
Symbolic model checking is a successful technique for checking properties of large finite-state systems. This method has been used to verify a number of real-world hardware desig...