Communicating sequential processes
Communicating sequential processes
Introduction to algorithms
Starvation and Critical Race Analyzers for Ada
IEEE Transactions on Software Engineering
Eliminating receive livelock in an interrupt-driven kernel
ACM Transactions on Computer Systems (TOCS)
A Unified Approach to Path Problems
Journal of the ACM (JACM)
Fast Algorithms for Solving Path Problems
Journal of the ACM (JACM)
Bandera: extracting finite-state models from Java source code
Proceedings of the 22nd international conference on Software engineering
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Analyzing Ada Tasking Deadlocks and Livelocks Using Extended Petri Nets
Proceedings of the Ada-Europe International Conference on Ada: The Choice for '92
Tutorial: Proving Properties of Concurrent System with SPIN
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
On the Absence of Livelocks in Parallel Programs
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
A CSP Model for Java Multithreading
PDSE '00 Proceedings of the International Symposium on Software Engineering for Parallel and Distributed Systems
On reductions and livelocks in asynchronous parallel computation.
On reductions and livelocks in asynchronous parallel computation.
Software Model Checking: The VeriSoft Approach
Formal Methods in System Design
Definitions and Detection of Deadlock, Livelock, and Starvation in Concurrent Programs
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
A new elimination-based data flow analysis framework using annotated decomposition trees
CC'07 Proceedings of the 16th international conference on Compiler construction
Operating Systems: Internals and Design Principles
Operating Systems: Internals and Design Principles
Static detection of access anomalies in ada95
Ada-Europe'06 Proceedings of the 11th Ada-Europe international conference on Reliable Software Technologies
Symbolic analysis of imperative programming languages
JMLC'06 Proceedings of the 7th joint conference on Modular Programming Languages
A livelock freedom analysis for infinite state asynchronous reactive systems
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Proving liveness by backwards reachability
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Liveness, fairness and impossible futures
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
A uniform classification of common concurrency errors
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
| Hi-index | 0.00 |
In this paper we present algorithms to statically detect live-locks in Ada multitasking programs. Although the algorithms' worst-case execution time is exponential, they can be expected to run in polynomial time. Since the problem is strongly connected to finding infinite loops, which is undecidable in general, our algorithms compute only an approximation to the real solution of the problem. As a consequence our algorithms may compute false positives.