5639 search results - page 231 / 1128 » Timed Abstract Non-interference |
118
Voted
DAC
2002
ACM
16 years 4 months ago
2002
ACM
We present a compositional approach to analyze timing behavior of complex platforms with different scheduling strategies. The approach uses event interfacing in order to couple pr...
127
click to vote
WADS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract We show that if one can find the optimal value of an integer programming problem min{cx : Ax ≥ b, x ∈ Zn +} in polynomial time, then one can find an optimal solution...
104
click to vote
ISMM
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We present an efficient implementation of the ultimate attribute opening operator. In this implementation, the ultimate opening is computed by processing the image maxtre...
138
Voted
ADAEUROPE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they...
103
click to vote
ISAAC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...