Supported Language

The current version of Quasar can analyze a large subset of the Ada language. This allows to cover most of the concurrency problems of application programs.

The restrictions define a sub part of Ada that is sufficient to code complex concurrent programs (see the examples section in the main page). Furthermore, these restrictions concern only the concurrent part of the program. Recall that Quasar analyses only concurrency and suppresses all parts of the program that do not influence concurrency : in the first step of Quasar all the part of the program which is not concerned with concurrency is sliced (i.e., removed from the analysis). Thus as long as concurrency is not concerned, full Ada language is accepted (and immediately sliced!). So, large application programs can be considered.

last update : 20/10/2005