535 search results - page 6 / 107 » Checking Computations in Polylogarithmic Time |
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive qu...
103
click to vote
RTSS
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we address the problem of symbolically computing the region in the parameter’s space that guarantees a feasible schedule, given a set of real-time tasks character...
FOSSACS
2007
Springer
15 years 3 months ago
2007
Springer
BIRTHDAY
2008
Springer
14 years 11 months ago
2008
Springer
We survey some of the problems associated with checking whether a given behavior (a sequence, a Boolean signal or a continuous signal) satisfies a property specified in an appropri...
113
click to vote
FOSSACS
2011
Springer
14 years 1 months ago
2011
Springer
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...