1192 search results - page 44 / 239 » Computing Weakest Readings |
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
In this paper, we present two new run-time algorithms for the parallelization of loops that have indirect access patterns. The algorithms can handle any type of loop-carried depen...
108
click to vote
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
106
click to vote
RTAS
2006
IEEE
15 years 5 months ago
2006
IEEE
We present an assume-guarantee interface algebra for real-time components. In our formalism a component implements a set of task sequences that share a resource. A component inter...
105
click to vote
TCAD
2008
14 years 11 months ago
2008
el Predicate Abstraction and Refinement Techniques for Verifying RTL Verilog Himanshu Jain, Daniel Kroening, Natasha Sharygina, and Edmund M. Clarke, Fellow, IEEE As a first step, ...
127
click to vote
FORMATS
2010
Springer
14 years 9 months ago
2010
Springer
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...