论文信息 - A Formal Framework for the Analysis of Recursive-Parallel Programs

A Formal Framework for the Analysis of Recursive-Parallel Programs

RP programs are imperative programs with parallelism and recursion and only a limited way of synchronizing parallel processes. The formal framework we propose here combines (1) a formal operational model of abstract programs (or RP schemes), (2) a set of decision methods for the analysis of RP schemes, (3) a formal operational model for the interpreted programs, and (4) translation results stating how some behavioural properties of the concrete programs can be correctly checked on the corresponding scheme.

Philippe Schnoebelen | Olga Kouchnarenko | P. Schnoebelen | O. Kouchnarenko

[1] Faron Moller,et al. Infinite Results , 1996, CONCUR.

[2] D. J. Walker,et al. Bisimulations and divergence , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[3] Olga Kouchnarenko. Sémantique des programmes récursifs-parallèles et méthodes pour leur analyse. (Semantics of recursive-parallel programs and methods for their analysis) , 1997 .

[4] J. Kruskal. Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture , 1960 .

[5] Javier Esparza,et al. More infinite results , 2001, INFINITY.

[6] Jan A. Bergstra,et al. Process theory based on bisimulation semantics , 1988, REX Workshop.

[7] Philippe Schnoebelen,et al. A model for recursive-parallel programs , 1996, INFINITY.

[8] J. Esparza. More Innnite Results , 1996 .

[9] Edmund M. Clarke,et al. Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..