Skip to Main content Skip to Navigation
Theses

Sémantique des programmes récursifs-parallèles et méthodes pour leur analyse

Abstract : We define a formal model for a class of recursive-parallel programs with specific invocation and synchronization primitives and study the corresponding program schemes. This model is not finite-state but can still be turned into a well-structured transition systems in the sense of Finkel, so that some interesting reachability problems are clearly decidable. Building on Plotkin's approach, the new semantics of these recursive-parallel program schemes give a clear understanding of the program behaviour, and a formal model in which to analyze the program properties. In this framework we can study the implementation model and prove its correctness.
Document type :
Theses
Complete list of metadatas

Cited literature [61 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00004949
Contributor : Thèses Imag <>
Submitted on : Friday, February 20, 2004 - 5:03:08 PM
Last modification on : Friday, November 6, 2020 - 3:53:53 AM
Long-term archiving on: : Wednesday, September 12, 2012 - 4:00:19 PM

Identifiers

  • HAL Id : tel-00004949, version 1

Collections

UJF | IMAG | CNRS | UGA

Citation

Olga Kouchnarenko. Sémantique des programmes récursifs-parallèles et méthodes pour leur analyse. Autre [cs.OH]. Université Joseph-Fourier - Grenoble I, 1997. Français. ⟨tel-00004949⟩

Share

Metrics

Record views

314

Files downloads

240