Sciweavers

27 search results - page 2 / 6
» Cooperative reasoning for preemptive execution
Sort
View
SIGSOFT
2010
ACM
13 years 2 months ago
A trace simplification technique for effective debugging of concurrent programs
Concurrent programs are notoriously difficult to debug. We see two main reasons for this: 1) concurrency bugs are often difficult to reproduce, 2) traces of buggy concurrent execu...
Nicholas Jalbert, Koushik Sen
FMSD
2007
133views more  FMSD 2007»
13 years 4 months ago
Static priority scheduling of event-triggered real-time embedded systems
Real-time embedded systems are often specified as a collection of independent tasks, each generating a sequence of event-triggered code blocks, and the scheduling in this domain ...
Cagkan Erbas, Andy D. Pimentel, Selin Cerav-Erbas
POPL
2011
ACM
12 years 7 months ago
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol
We consider programs for embedded real-time systems which use priority-driven preemptive scheduling with task priorities adjusted dynamically according to the immediate ceiling pr...
Martin D. Schwarz, Helmut Seidl, Vesal Vojdani, Pe...
IJCAI
2001
13 years 6 months ago
Executing Reactive, Model-based Programs through Graph-based Temporal Planning
In the future, webs of unmanned air and space vehicles will act together to robustly perform elaborate missions in uncertain environments. We coordinate these systems by introduci...
Phil Kim, Brian C. Williams, Mark Abramson
PLISP
1989
13 years 8 months ago
Speculative Computation in Multilisp
Speculative computing is a technique to improve the execution time of certain applications by starting some computations before it is known that the computations are required. A s...
Randy B. Osborne