Abstract. Concurrency introduces a high degree of combinatory which may be the source of subtle mistakes. We present a new tool, Quasar, which is based on ASIS and which uses fully the concept of patterns. The analysis of a concurrent Ada program by our tool proceeds in four steps: automatic extraction of the concurrent part of the program; translation of the simplified program into a formal model using predefined patterns that are combined by substitution and merging constructors; analysis of the model both by structural techniques and model-checking techniques; reporting deadlock or starvation results. We demonstrate the usefulness of Quasar by analyzing several variations of a non trivial concurrent program.
In this paper we discuss the relevance of Higher-Dimensional Automata to program analysis. Most of t...
The design of concurrent programs is error-prone due to the interaction between concurrently executi...
The behavior of concurrent Ada programs is very difficult to understand because of the complexity in...
In this paper we present an original and useful way for specifying and verifying temporal properties...
Abstract. The inclusion of dynamic tasks modelisation in QUASAR, a tool for automatic analysis of co...
This paper presents several techniques for improving the accuracy of static analysis of concurrent A...
Aiming at developing reliable concurrent software, the engineering practice uses appropriate metrics...
International audienceAiming at developing reliable concurrent software, the engineering practice us...
An earlier report [PB-157] presented the argument for diagrams as the most suitable models for prog...
ABSTRACT formally, experimentation can help develop estimates of Software engineering has suffered f...
Spurious results are an inherent problem of most static analysis methods. These methods, in an effor...
We propose an approach for detecting deadlocks and race conditions in Ada tasking software. It is ba...
Related material available on the Quasar Websitehttp://quasar.cnam.fr/files/concurrency_papers.htmlS...
This paper presents FLAVERS, a nite state verication approach that analyzes whether concurrent or se...
In general, we would like any static analysis method to be conservative; for a given property, the a...
In this paper we discuss the relevance of Higher-Dimensional Automata to program analysis. Most of t...
The design of concurrent programs is error-prone due to the interaction between concurrently executi...
The behavior of concurrent Ada programs is very difficult to understand because of the complexity in...
In this paper we present an original and useful way for specifying and verifying temporal properties...
Abstract. The inclusion of dynamic tasks modelisation in QUASAR, a tool for automatic analysis of co...
This paper presents several techniques for improving the accuracy of static analysis of concurrent A...
Aiming at developing reliable concurrent software, the engineering practice uses appropriate metrics...
International audienceAiming at developing reliable concurrent software, the engineering practice us...
An earlier report [PB-157] presented the argument for diagrams as the most suitable models for prog...
ABSTRACT formally, experimentation can help develop estimates of Software engineering has suffered f...
Spurious results are an inherent problem of most static analysis methods. These methods, in an effor...
We propose an approach for detecting deadlocks and race conditions in Ada tasking software. It is ba...
Related material available on the Quasar Websitehttp://quasar.cnam.fr/files/concurrency_papers.htmlS...
This paper presents FLAVERS, a nite state verication approach that analyzes whether concurrent or se...
In general, we would like any static analysis method to be conservative; for a given property, the a...
In this paper we discuss the relevance of Higher-Dimensional Automata to program analysis. Most of t...
The design of concurrent programs is error-prone due to the interaction between concurrently executi...
The behavior of concurrent Ada programs is very difficult to understand because of the complexity in...