Compiling Cooperative Task Management to Continuations

Abstract : Although preemptive concurrency models are dominant for multi-threaded concurrency, they may be criticized for the complexity of reasoning because of the implicit context switches. The actor model and cooperative concurrency models have regained attention as they encapsulate the thread of control. In this paper, we formalize a continuation-based compilation of cooperative multitasking for a simple language and prove its correctness.
Type de document :
Communication dans un congrès
Farhad Arbab; Marjan Sirjani. 5th International Conference on Fundamentals of Software Engineering (FSEN), Apr 2013, Tehran, Iran. Springer Berlin Heidelberg, Lecture Notes in Computer Science, LNCS-8161, pp.95-110, 2013, Fundamentals of Software Engineering. 〈10.1007/978-3-642-40213-5_7〉
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01514661
Contributeur : Hal Ifip <>
Soumis le : mercredi 26 avril 2017 - 15:22:00
Dernière modification le : mercredi 26 avril 2017 - 15:26:39
Document(s) archivé(s) le : jeudi 27 juillet 2017 - 13:09:48

Fichier

978-3-642-40213-5_7_Chapter.pd...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Keiko Nakata, Andri Saar. Compiling Cooperative Task Management to Continuations. Farhad Arbab; Marjan Sirjani. 5th International Conference on Fundamentals of Software Engineering (FSEN), Apr 2013, Tehran, Iran. Springer Berlin Heidelberg, Lecture Notes in Computer Science, LNCS-8161, pp.95-110, 2013, Fundamentals of Software Engineering. 〈10.1007/978-3-642-40213-5_7〉. 〈hal-01514661〉

Partager

Métriques

Consultations de la notice

44

Téléchargements de fichiers

29