Abstract A new correctness concept, called partial-order preserving property, for event-driven execution monitoring of Ada tasking programs is presented. By using this concept, we can describe whether or not the tasking behavior of monitored Ada programs refrains from interference by monitoring actions of an event-driven execution monitor. In this paper, we define the equivalence of dynamic concurrent structures with respect to Ada program transformation, and propose this equivalence as a partial-order preserving criterion of the $pro$gram transformation used in a preprocessor of an event-driven execution monitor of Ada tasking programs. The equivalence is formally based on the lattice of dynamic concurrent structure of Ada programs which p...
Abstract—Atomic actions are an important dynamic structuring technique that aid the construction of ...
We propose an approach for detecting deadlocks and race conditions in Ada tasking software. It is ba...
The behavior of concurrent Ada programs is very difficult to understand because of the complexity in...
A visual execution model for Ada tasking can help programmers attain a deeper understanding of the t...
During maintenance and particularly during corrective and perfective tasks, systems tend to exhibit ...
AbstractA subset of ADA is introduced, ADA-CF, to study the basic synchronization and communication ...
Symbolic execution is a well known technique for analyzing sequential programs. It has a set of impo...
In this paper, we develop a syntax-directed proof system for a fragment of Ada consisting of the ess...
In this paper, various formalisms (the operational approach, the denotational approach, the axiomati...
International Real-Time Ada Workshop (IRTAW 2015). 20 to 22, Apr, 2015. Pownal, U.S.A..The approach ...
In earlier work, we proposed extending Ada with a high-level parallel programming layer consisting ...
Abstract. Concurrency introduces a high degree of combinatory which may be the source of subtle mist...
A previous paper compared the mechanisms for process communication in Hoare's communicating sequenti...
We consider the problem of defining and, most important, of using, the backward error recovery techn...
We propose a method for analyzing partially-implemented real-time systems. Here we consider real-tim...
Abstract—Atomic actions are an important dynamic structuring technique that aid the construction of ...
We propose an approach for detecting deadlocks and race conditions in Ada tasking software. It is ba...
The behavior of concurrent Ada programs is very difficult to understand because of the complexity in...
A visual execution model for Ada tasking can help programmers attain a deeper understanding of the t...
During maintenance and particularly during corrective and perfective tasks, systems tend to exhibit ...
AbstractA subset of ADA is introduced, ADA-CF, to study the basic synchronization and communication ...
Symbolic execution is a well known technique for analyzing sequential programs. It has a set of impo...
In this paper, we develop a syntax-directed proof system for a fragment of Ada consisting of the ess...
In this paper, various formalisms (the operational approach, the denotational approach, the axiomati...
International Real-Time Ada Workshop (IRTAW 2015). 20 to 22, Apr, 2015. Pownal, U.S.A..The approach ...
In earlier work, we proposed extending Ada with a high-level parallel programming layer consisting ...
Abstract. Concurrency introduces a high degree of combinatory which may be the source of subtle mist...
A previous paper compared the mechanisms for process communication in Hoare's communicating sequenti...
We consider the problem of defining and, most important, of using, the backward error recovery techn...
We propose a method for analyzing partially-implemented real-time systems. Here we consider real-tim...
Abstract—Atomic actions are an important dynamic structuring technique that aid the construction of ...
We propose an approach for detecting deadlocks and race conditions in Ada tasking software. It is ba...
The behavior of concurrent Ada programs is very difficult to understand because of the complexity in...