论文信息 - Implementing a Static Analyzer of Concurrent Programs: Problems and Perspectives

Implementing a Static Analyzer of Concurrent Programs: Problems and Perspectives

The aim of the paper is to share the design problems we experienced when we were implementing a prototype analyzer of an asynchronous concurrent language. This new kind of static analyzer is based on previous work about operational semantics of parallel languages that can express concurrency and non-determinism of actions: it constructs abstract automata reflecting all the possible execution behaviours of programs written in languages such as Parallel Pascal [Cri95] or Concurrent ML [Cri96].

Régis Cridlig | Régis Cridlig

[1] Antti Valmari,et al. Eliminating Redundant Interleavings During Concurrent Program Verification , 1989, PARLE.

[2] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.

[3] Rance Cleaveland,et al. Optimality in Abstractions of Model Checking , 1995, SAS.

[4] F. Bourdoncle. Semantiques des langages imperatifs d'ordre superieur et interpretation abstraite , 1992 .

[5] Régis Cridlig,et al. Semantic analysis of shared-memory concurrent languages using abstract model-checking , 1995, PEPM '95.

[6] Niklaus Wirth,et al. Pascal User Manual and Report , 1991, Springer New York.

[7] Patrick Cousot,et al. Semantic Analysis of Communicating Sequential Processes (Shortened Version) , 1980, ICALP.

[8] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.