149 search results - page 5 / 30 » Symbolic Modeling and Evaluation of Data Paths |
170
click to vote
ICFEM
2009
Springer
15 years 3 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
190
click to vote
ECRTS
2002
IEEE
15 years 10 months ago
2002
IEEE
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
164
click to vote
PPOPP
2010
ACM
16 years 2 months ago
2010
ACM
We present a static analysis for the automatic generation of symbolic prefetches in a transactional distributed shared memory. A symbolic prefetch specifies the first object to be...
162
click to vote
FMCAD
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. This paper presents a scalable method for parallel symbolic on-the-fly model checking in a distributed memory environment. Our method combines a scheme for on-the-fly mod...
184
Voted
ADC
2008
Springer
15 years 12 months ago
2008
Springer
This article describes how to implement efficient memory resident path indexes for semi-structured data. Two techniques are introduced, and they are shown to be significantly fas...