Ada 95 is an expressive concurrent programming lan-guage, which allows building large multi-tasking applica-tions. Much of the complexity of these applications stems from the interactions between the tasks. Design abstrac-tions (such as atomic actions, conversations etc.) have been proposed to deal with such complexity. This paper argues that Petri nets offer a promising, tool-supported, technique for checking the logical correctness of abstractions. The paper illustrates the effectiveness of this approach by show-ing the correctness of an Ada implementation of the atomic action protocol using a variety of Petri net tools. 1
Spurious results are an inherent problem of most static analysis methods. These methods, in an effor...
Cette thèse s'inscrit dans le cadre de la vérification automatique de programmes concurrents basée s...
This thesis enters in the frame of the automatic verification of concurrent software based on an int...
The behavior of concurrent Ada programs is very difficult to understand because of the complexity in...
One important role for Ada programming is to aid engineering of concurrent and distributed software....
SIGLEAvailable from British Library Document Supply Centre-DSC:8724.920(no CS-TR-700) / BLDSC - Brit...
Available from British Library Document Supply Centre-DSC:8724.920(no CS-TR-706) / BLDSC - British L...
One major difficulty that faces developers of concurrent and distributed software is analysis for co...
This paper presents a compact Petri net representation for concurrent programs with explicit tasking...
One major difficulty that faces developers of concurrent and distributed software is analysis for co...
Petri Nets have developed over the years into a suitable model for representing and studying concurr...
The components of many parallel applications (processes, resources, communication links .... ) can b...
Concurrency is ubiquitous in modern software. The computing base of systems software, including oper...
In general, we would like any static analysis method to be conservative; for a given property, the a...
We propose an approach for detecting deadlocks and race conditions in Ada tasking software. It is ba...
Spurious results are an inherent problem of most static analysis methods. These methods, in an effor...
Cette thèse s'inscrit dans le cadre de la vérification automatique de programmes concurrents basée s...
This thesis enters in the frame of the automatic verification of concurrent software based on an int...
The behavior of concurrent Ada programs is very difficult to understand because of the complexity in...
One important role for Ada programming is to aid engineering of concurrent and distributed software....
SIGLEAvailable from British Library Document Supply Centre-DSC:8724.920(no CS-TR-700) / BLDSC - Brit...
Available from British Library Document Supply Centre-DSC:8724.920(no CS-TR-706) / BLDSC - British L...
One major difficulty that faces developers of concurrent and distributed software is analysis for co...
This paper presents a compact Petri net representation for concurrent programs with explicit tasking...
One major difficulty that faces developers of concurrent and distributed software is analysis for co...
Petri Nets have developed over the years into a suitable model for representing and studying concurr...
The components of many parallel applications (processes, resources, communication links .... ) can b...
Concurrency is ubiquitous in modern software. The computing base of systems software, including oper...
In general, we would like any static analysis method to be conservative; for a given property, the a...
We propose an approach for detecting deadlocks and race conditions in Ada tasking software. It is ba...
Spurious results are an inherent problem of most static analysis methods. These methods, in an effor...
Cette thèse s'inscrit dans le cadre de la vérification automatique de programmes concurrents basée s...
This thesis enters in the frame of the automatic verification of concurrent software based on an int...