Systems design with ADA.
Programming in Prolog (2nd ed.)
Programming in Prolog (2nd ed.)
Fairness
IEEE Transactions on Software Engineering
Artificial intelligence (2nd ed.)
Artificial intelligence (2nd ed.)
Software CAD: A Revolutionary Approach
IEEE Transactions on Software Engineering
A general-purpose algorithm for analyzing concurrent programs
Communications of the ACM
Critical Races in Ada Programs
IEEE Transactions on Software Engineering
Experience with the automatic temporal analysis of multitasking Ada designs
SIGAda '87 Proceedings of the 1987 annual ACM SIGAda international conference on Ada
On Communicating Finite-State Machines
Journal of the ACM (JACM)
An overview and example of application of CAEDE: a new, experimental design environment for Ada
SIGAda '85 Proceedings of the 1985 annual ACM SIGAda international conference on Ada
ACM Computing Surveys (CSUR)
Concurrent control with “readers” and “writers”
Communications of the ACM
On the Absence of Livelocks in Parallel Programs
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Experiments with an improved constrained expression toolset
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Automated Analysis of Concurrent Systems with the Constrained Expression Toolset
IEEE Transactions on Software Engineering
Temporal Logic-Based Deadlock Analysis for Ada
IEEE Transactions on Software Engineering
Using state space reduction methods for deadlock analysis in Ada tasking
ISSTA '93 Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis
An empirical evaluation of three methods for deadlock analysis of Ada tasking programs
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
An Application of Petri Net Reduction for Ada Tasking Deadlock Analysis
IEEE Transactions on Parallel and Distributed Systems
Compositional verification of concurrent systems using Petri-net-based condensation rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Comments on 'Temporal Logic-Based Deadlock Analysis for Ada' by G.M. Karam and R.J.A. Burh
IEEE Transactions on Software Engineering
Evaluating Deadlock Detection Methods for Concurrent Software
IEEE Transactions on Software Engineering
Static Analysis of Concurrent Programs Using Ordinary Differential Equations
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Static detection of Livelocks in Ada multitasking programs
Ada-Europe'07 Proceedings of the 12th international conference on Reliable software technologies
Parallel computation of continuous Petri nets based on hypergraph partitioning
The Journal of Supercomputing
| Hi-index | 0.00 |
Starvation and critical race analysis tools for Ada designs are described. These tools are part of a temporal analysis toolset that includes an operational specification language, a language interpreter, and a deadlock analyzer for Ada. The starvation analyzer is based on a set-theoretic model of starvation. It uses a proof tree produced by the deadlock analyzer to define the possible computation space of the design. A preprocessing phase of the starvation tool optimizes the analysis so that the resulting analysis is efficient. Unlike livelock analysis in state machines, the starvation analyzer does not require a priori specification of home states to discern liveness. The critical race analysis tool provides semiautomatic proof of critical races by identifying nondeterministic rendezvous (races) from the proof tree generated by the deadlock analyzer, and then assisting the human operator in identifying which of these constitute critical races. Several design examples are used to demonstrate the capabilities of the two analysis methods.