Concurrent programming in Ada
Using the VAX/VMS lock manager with Ada tasks
ACM SIGAda Ada Letters
ACM SIGAda Ada Letters
Implementation of classical mutual exclusion algorithms in Ada
ACM SIGAda Ada Letters
An Ada solution to the general mutual exclusion problem
ACM SIGAda Ada Letters
Memory management in Ada83 and Ada9X
ACM SIGAda Ada Letters
ACM SIGAda Ada Letters
Fault tolerance in distributed Ada 95
IRTAW '97 Proceedings of the eighth international workshop on Real-Time Ada
ACM SIGAda Ada Letters
Addressing security for object-oriented design and Ada 95 development
ACM SIGAda Ada Letters
A fully reusable class of objects for synchronization and communication in Ada 95
ACM SIGAda Ada Letters
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Understanding operating systems (3rd ed.)
Understanding operating systems (3rd ed.)
A classification of tasking deadlocks
ACM SIGAda Ada Letters
ACM SIGOPS Operating Systems Review
Defining deadlock with fungible resources
ACM SIGOPS Operating Systems Review
Enforcing security and safety models with an information flow analysis tool
Proceedings of the 2004 annual ACM SIGAda international conference on Ada: The engineering of correct and reliable software for real-time & distributed systems using Ada and related technologies
Tasking deadlocks in programs with the full Ada 95
ACM SIGAda Ada Letters
| Hi-index | 0.00 |
One of the strengths of the Ada Programming Language is its support of software engineering principles. In particular, many Ada constructs assist in the control of various anomalies of computer systems. This paper discusses two classes of anomalies that are shown to have similar characteristics. The first of these classes involves the mutual exclusion problem, for which there exists considerable literature within the Ada community. We compare this category of anomalies to intrusion, a security anomaly, and suggest that mechanisms for the control of the first should be considered for the second.