359 search results - page 7 / 72 » Order Scheduling Models: Hardness and Algorithms |
117
click to vote
FMSD
2002
14 years 11 months ago
2002
We present a new technique for verification of complex hardware devices that allows both generality andahighdegreeofautomation.Thetechniqueisbasedonournewwayofconstructinga"li...
ECRTS
2003
IEEE
15 years 5 months ago
2003
IEEE
A theory of resource sharing in a mixed system with hard real-time and non-real-time processing requirements is presented. The real-time processing is modeled as rate-based execut...
101
click to vote
ADAEUROPE
2005
Springer
15 years 5 months ago
2005
Springer
: In previous papers we had presented an application program interface (API) that enabled applications to use application-defined scheduling algorithms for Ada tasks in a way compa...
114
click to vote
FMCAD
1998
Springer
15 years 3 months ago
1998
Springer
We present a new approach to the verification of hardware systems with data dependencies using temporal logic symbolic model checking. As a benchmark we take Tomasulo's algori...
ENTCS
2007
14 years 11 months ago
2007
Software model checkers are typically language-specific, require substantial development efforts, and are hard to reuse for other languages. Adding partial order reduction (POR)...