Formalisation of FunLoft

Frédéric Boussinot 1 Frederic Dabrowski 2
1 MIMOSA - Migration and mobility : semantics and applications
CRISAM - Inria Sophia Antipolis - Méditerranée , Université de Provence - Aix-Marseille 1, MINES ParisTech - École nationale supérieure des mines de Paris
2 Lande - Logiciel : ANalyse et DEveloppement
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : We formalise a thread-based concurrent language which makes resource control possible. Concurrency is based on a two-level model: threads are executed cooperatively when linked to a scheduler, and unlinked threads and schedulers are executed preemptively, under the control of the OS. We present a type and effect system to enforce a logical separation of the memory which ensures that (1) when running in preemptive mode, threads do not interfere with other threads; (2) threads linked to a scheduler do not interfere with threads linked to another scheduler. Thus, we get a concurrency model in which well-typed programs are free from data-races. The type system also insures that well-typed programs are bounded in memory and in their use of the CPU. Detection of termination of recursive functions and stratification of references in memory are techniques used to get these properties.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/inria-00183242
Contributor : Frederic Boussinot <>
Submitted on : Monday, October 29, 2007 - 3:57:24 PM
Last modification on : Friday, November 16, 2018 - 1:23:19 AM
Long-term archiving on : Monday, September 24, 2012 - 2:45:29 PM

File

fl_formal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00183242, version 1

Citation

Frédéric Boussinot, Frederic Dabrowski. Formalisation of FunLoft. 2007. ⟨inria-00183242⟩

Share

Metrics

Record views

386

Files downloads

192