Dynamic Tasks Verification with Quasar [chapter]

Sami Evangelista, Claude Kaiser, Christophe Pajault, Jean Francois Pradat-Peyre, Pierre Rousseau
2005 Lecture Notes in Computer Science  
The inclusion of dynamic tasks modelisation in QUASAR, a tool for automatic analysis of concurrent programs, extends its applicative usefulness. However this extension leads to large size models whose processing has to face combinatory explosion of modeling states. This paper presents briefly Ada dynamic tasks semantic and dependences and then it explains the choice of an efficient generic modeling pattern. This implies to consider the naming, the hierarchy, the master retrieval, the
more » ... of dynamic tasks and their synchronization dependences successively. The adequacy of both this modeling and the QUASAR techniques is highlighted by the analysis of two non-trivial Ada programs. The large reduction factor between the initial and final state numbers of these program models shows that the state explosion can be limited, making automatic validation of dynamic concurrent programs feasible.
doi:10.1007/11499909_8 fatcat:3gjq7wrjlrd43nyceiabrgnjma