Abstract. Although priority scheduling in concurrent programs pro-vides a clean way of synchronization, developers still additionally rely on hand-crafted schemes based on integer variables to protect critical sections. We identify a set of sufficient conditions for variables to serve this purpose. We provide efficient methods to verify these conditions, which enable us to construct an enhanced analysis of mutual exclusion in interrupt-driven concurrent programs. All our algorithms are build upon off-the-shelf inter-procedural analyses alone. We have implemented this approach for the analysis of automotive controllers, and demonstrate that it results in a major improvement in the precision of data race de-tection compared to purely priority...
Mutual exclusion is a fundamental problem in distributed computing. In one well known variant of thi...
AbstractWe establish trade-offs between time complexity and write- and access-contention for solutio...
Due to common resource protection, most real-time tasks have non-preemptive sections. Such sections,...
Abstract. We present a reduction from a concurrent real-time program with priority preemptive schedu...
uni-muenster.de We consider programs for embedded real-time systems which use priority-driven preemp...
Abstract. We present a reduction from a concurrent real-time program with priority preemptive schedu...
We propose a method for the timing analysis of concurrent real-time programs with hard deadlines. We...
We propose a method for the timing analysis of concur-rent real-time programs with hard deadlines. W...
A simple proof method is presented for proving invariance properties of concurrent programs in prior...
International audienceIn previous work, we developed a sound static analysis by abstract interpretat...
Parallel programming is an intellectually demanding task. One of the most difficult challenges in th...
In order to study the problems of synchronization between concurrent processes, a distinction is mad...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
The hard deadline model is very popular in real-time research, but is representative or applicable t...
Abstract — Priority queues are fundamental in the design of modern multiprocessor algorithms. Priori...
Mutual exclusion is a fundamental problem in distributed computing. In one well known variant of thi...
AbstractWe establish trade-offs between time complexity and write- and access-contention for solutio...
Due to common resource protection, most real-time tasks have non-preemptive sections. Such sections,...
Abstract. We present a reduction from a concurrent real-time program with priority preemptive schedu...
uni-muenster.de We consider programs for embedded real-time systems which use priority-driven preemp...
Abstract. We present a reduction from a concurrent real-time program with priority preemptive schedu...
We propose a method for the timing analysis of concurrent real-time programs with hard deadlines. We...
We propose a method for the timing analysis of concur-rent real-time programs with hard deadlines. W...
A simple proof method is presented for proving invariance properties of concurrent programs in prior...
International audienceIn previous work, we developed a sound static analysis by abstract interpretat...
Parallel programming is an intellectually demanding task. One of the most difficult challenges in th...
In order to study the problems of synchronization between concurrent processes, a distinction is mad...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
The hard deadline model is very popular in real-time research, but is representative or applicable t...
Abstract — Priority queues are fundamental in the design of modern multiprocessor algorithms. Priori...
Mutual exclusion is a fundamental problem in distributed computing. In one well known variant of thi...
AbstractWe establish trade-offs between time complexity and write- and access-contention for solutio...
Due to common resource protection, most real-time tasks have non-preemptive sections. Such sections,...