R. Acosta-bermejo, Reactive operating system, reactive java objects, Proceedings of NO- TERE'2000, 2000.

R. M. Amadio, Max-Plus Quasi-interpretations, Proceedings of Typed Lambda Calculi and Applications, 2003.
DOI : 10.1007/3-540-44904-3_3
URL : https://hal.archives-ouvertes.fr/hal-00146999

R. M. Amadio, The SL synchronous language, revisited, The Journal of Logic and Algebraic Programming, vol.70, issue.2, pp.121-150, 2005.
DOI : 10.1016/j.jlap.2006.08.001
URL : https://hal.archives-ouvertes.fr/hal-00014540

R. M. Amadio, Synthesis of max-plus quasi-interpretations, Fundamenta Informaticae, vol.65, issue.12, p.2960, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00146968

R. M. Amadio, A synchronous pi-calculus, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00078319

R. M. Amadio and G. Boudol, Frédéric Boussinot, and Illaria Castellani. Reactive programming , revisited, Electronic Notes in TCS, vol.162, pp.49-90, 2005.

R. M. Amadio, S. Coupet-grimal, S. Dal-zilio, and L. Jakubiec, A Functional Scenario for Bytecode Verification of Resource Bounds, Proceedings of CSL 2004, 2004.
DOI : 10.1007/978-3-540-30124-0_22
URL : https://hal.archives-ouvertes.fr/hal-00146991

M. Roberto, F. Amadio, and . Dabrowski, Feasible reactivity for synchronous cooperative threads, Electronic Notes in TCS, vol.154, issue.3, pp.33-43, 2005.

M. Roberto, S. D. Amadio, and . Zilio, Resource control for synchronous cooperative threads, Theoretical Computer Science, vol.358, pp.229-254, 2004.

D. Aspinall, S. Gilmore, M. Hofmann, D. Sannella, and I. Stark, Mobile Resource Guarantees for Smart Devices, Construction and Analysis of Safe, Secure and Interoperable Smart Devices : Proceedings of the International Workshop CASSIS 2004, number 3362 in Lecture Notes in Computer Science, pp.1-26, 2005.
DOI : 10.1007/978-3-540-30569-9_1

F. Baader and T. Nipkow, Term rewriting and all that, 1998.

S. Bellantoni and S. Cook, A new recursion-theoretic characterization of the polytime functions (extended abstract), Proceedings of the twenty-fourth annual ACM symposium on Theory of computing , STOC '92, pp.283-293, 1992.
DOI : 10.1145/129712.129740

A. Benveniste and G. Berry, The synchronous approach to reactive and real-time systems. Another Look at Real Time Programming, Proceedings of the IEEE, pp.1270-1282, 1991.
URL : https://hal.archives-ouvertes.fr/inria-00075115

A. Benveniste, P. Caspi, S. A. Edwards, N. Halbwachs, P. L. Guernic et al., The synchronous languages 12 years later, Proceedings of the IEEE, 2003.
DOI : 10.1109/JPROC.2002.805826

G. Berry and G. Gonthier, The Esterel synchronous programming language: design, semantics, implementation, Science of Computer Programming, vol.19, issue.2, pp.87-152, 1992.
DOI : 10.1016/0167-6423(92)90005-V
URL : https://hal.archives-ouvertes.fr/inria-00075711

A. D. Birrell, An introduction to programming with threads, 1989.

G. Bonfante, A. Cichon, and J. Marion, Complexity Classes and Rewrite Systems with Polynomial Interpretation, CSL, pp.372-384, 1998.
DOI : 10.1007/10703163_25
URL : https://hal.archives-ouvertes.fr/inria-00098689

G. Bonfante, J. Marion, and J. Moyen, On Lexicographic Termination Ordering with Space Bound Certifications, Dines Bjørner
DOI : 10.1007/3-540-45575-2_46
URL : https://hal.archives-ouvertes.fr/inria-00100523

G. Bonfante, J. Marion, and J. Moyen, Quasi-interpretations a way to control resources, Theoretical Computer Science, vol.412, issue.25
DOI : 10.1016/j.tcs.2011.02.007
URL : https://hal.archives-ouvertes.fr/hal-00591862

G. Boudol, ULM: A Core Programming Model for Global Computing, Proceedings of the 13th European Symposium on Programming, 2004.
DOI : 10.1007/978-3-540-24725-8_17

F. Boussinot, Reactive C: An extension of C to program reactive systems, Software: Practice and Experience, vol.21, issue.4, pp.401-428, 1991.
DOI : 10.1002/spe.4380210406

F. Boussinot, Icobj programming, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00073665

F. Boussinot, Java fair threads, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00072487

F. Boussinot, Operational semantics of cooperative fair threads, unpublished, 2002.

F. Boussinot, FairThreads: mixing cooperative and preemptive threads in C, Concurrency and Computation: Practice and Experience, vol.11, issue.5, pp.445-469, 2006.
DOI : 10.1002/cpe.919
URL : https://hal.archives-ouvertes.fr/inria-00071544

F. Boussinot and R. Simone, The SL synchronous language, IEEE Transactions on Software Engineering, vol.22, issue.4, pp.256-266, 1996.
DOI : 10.1109/32.491649
URL : https://hal.archives-ouvertes.fr/inria-00074168

F. Boussinot, L. Hazard, and J. Susini, The junior reactive kernel, 1999.
URL : https://hal.archives-ouvertes.fr/inria-00072933

F. Boussinot and J. Susini, The sugarcubes tool box, 1997.
URL : https://hal.archives-ouvertes.fr/inria-00073442

C. Boyapati, R. Lee, and M. Rinard, Ownership types for safe programming : preventing data races and deadlocks, OOPSLA '02 : Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, pp.211-230, 2002.

C. Boyapati and M. Rinard, A parameterized type system for race-free Java programs, 16th Annual Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), 2001.

C. Brunette, Construction et simulation graphiques de comportements : le modèle des Icobjs, 2004.

P. Caspi and M. Pouzet, Synchronous kahn networks, International Conference on Functional Programming, pp.226-238, 1996.

E. Chailloux, P. Manoury, and B. Pagano, Developing Applications With Objective Caml, 2000.

J. Choi, K. Lee, A. Loginov, R. O. Callahan, V. Sarkar et al., Efficient and precise datarace detection for multithreaded object-oriented programs, PLDI '02 : Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, pp.258-269, 2002.

A. Cichon, Bounds on derivation lengths from termination proofs, 1990.

A. Cobham, The intrinsic computational difficulty of functions, Logic, Methodology, and Philosophy of Science, pp.24-30, 1964.

N. Dershowitz, Orderings for term-rewriting systems, Theoretical Computer Science, vol.17, issue.3, pp.279-301, 1982.
DOI : 10.1016/0304-3975(82)90026-3

N. Dershowitz and J. Jouannaud, Rewrite systems In Handbook of Theoretical Computer Science, Volume B : Formal Models and Sematics (B), pp.243-320, 1990.

N. Dershowitz and Z. Manna, Proving termination with multiset orderings, Communications of the ACM, vol.22, issue.8, pp.465-476, 1979.
DOI : 10.1145/359138.359142

W. Edsger and . Dijkstra, Cooperating sequential processes, pp.65-138, 2002.

S. Epardaud, Mobile reactive programming in ULM, 2004.

C. Flanagan and M. Abadi, Types for Safe Locking, ESOP '99 : Proceedings of the 8th European Symposium on Programming Languages and Systems, pp.91-108, 1999.
DOI : 10.1007/3-540-49099-X_7

C. Flanagan and S. N. Freund, Type-based race detection for java, PLDI '00 : Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation, pp.219-232, 2000.

C. Flanagan, N. Stephen, and . Freund, Atomizer : a dynamic atomicity checker for multithreaded programs, POPL '04 : Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp.256-267, 2004.

C. Flanagan and S. Qadeer, A type and effect system for atomicity, 2003.

C. Flanagan and S. Qadeer, Types for atomicity, TLDI '03 : Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation, pp.1-12, 2003.

G. Gonthier, Sémantique et modèles d'exécution des langages réactifs synchrones : applicationsàcations`cationsà Esterel, 1988.

N. Halbwachs, Synchronous programming of reactive systems, Kluwer Academic Pub, 1993.

N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud, The synchronous dataflow programming language LUSTRE. Another Look at Real Time Programming, Proceedings of the IEEE, pp.1305-1320, 1991.

K. Hammond, An abstract machine for resource-bounded computations in hume, Draft paper submitted to IFL '03 ? 2014 Implementation of Functional Languages, 2003.

K. Hammond and G. Michaelson, The Design of Hume: A High-Level Language for the Real-Time Embedded Systems Domain, TOCHECK, 2003.
DOI : 10.1007/978-3-540-25935-0_8

K. Hammond and G. Michaelson, Hume: A Domain-Specific Language for Real-Time Embedded Systems, Proc. Conf. Generative Programming and Component Engineering, 2003.
DOI : 10.1007/978-3-540-39815-8_3

T. Hardin, Produire un logiciel de confiance : quelles hypothèses, quelles limites ?, Journées Francophones des Langages Applicatifs, 2002.

D. Harel and A. Pnueli, On the development of reactive systems In Logics and Models of Concurrent Systems, NATO Advanced Summer Institutes, volume F-13, pp.477-498, 1985.

T. Harris and K. Fraser, Language support for lightweight transactions, OOPSLA '03 : Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems , languages, and applications, pp.388-402, 2003.

C. A. Hoare, Monitors: an operating system structuring concept, Communications of the ACM, vol.17, issue.10, pp.549-557, 1974.
DOI : 10.1145/355620.361161
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.6394

D. Hofbauer, Termination proofs by multiset path orderings imply primitive recursive derivation lengths, Theoretical Computer Science, vol.105, issue.1, pp.129-140, 1992.
DOI : 10.1016/0304-3975(92)90289-R
URL : http://dx.doi.org/10.1016/0304-3975(92)90289-r

M. Hofmann, A type system for bounded space and functional in-place update, Nordic J. of Computing, vol.7, issue.4, pp.258-289, 2000.

M. Hofmann, The strength of non-size increasing computation, POPL '02 : Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp.260-269, 2002.

J. Ousterhout, Why threads are a bad idea (for most purposes) -http, 1996.

P. Jouvelot and D. Gifford, Algebraic reconstruction of types and effects, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, pp.303-310, 1991.
DOI : 10.1145/99583.99623

G. Kahn, The semantics of a simple language for parallel programming, Information Processing, 1974.

S. Kamin and J. Lévy, Attempts for generalizing the recursive path orderings. Rapport technique, Université de l'Illinois, 1980.

J. W. Klop, Term rewriting systems, Handbook of Logic in Computer Science, Volumes 1 (Background : M athematical Structures) and 2 (Background : Computational Structures)

D. S. Landford, On proving term rewriting systems are noetheriens, 1979.

T. Paul-le-guernic, M. L. Gautier, C. L. Borgne, and M. , Programming real time applications with signal, Proc. IEEE, Special Issue, vol.79, pp.1321-1336, 1991.

N. D. Chin-soon-lee, . Jones, M. Amir, and . Ben-amram, The size-change principle for program termination, ACM SIGPLAN Notices, vol.36, issue.3, pp.81-92, 2001.

D. Leivant, A foundational delineation of computational feasibility, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.2-11, 1991.
DOI : 10.1109/LICS.1991.151625

L. Mandel and . Conception, Sémantique et Implantation de ReactiveML : un langagè a la ML pour la programmation réactive, 2006.

L. Mandel and F. Benbadis, Simulation of mobile ad hoc network protocols in ReactiveML, Synchronous Languages, Applications and Programming (SLAP'05). ENTCS, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01488510

L. Mandel and M. Pouzet, ReactiveML, Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming , PPDP '05, pp.82-93, 2005.
DOI : 10.1145/1069774.1069782
URL : https://hal.archives-ouvertes.fr/hal-01508179

J. Marion, Complexité implicite des calculs, de la théoriè a la pratique. HabilitationàHabilitation`Habilitationà diriger les recherches, 2000.

J. Marion, Analysing the implicit complexity of programs. Information and Computation, pp.2-18, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099505

J. Marion and J. Moyen, Efficient first order functional program interpreter with time bound certifications, Logic for Programming and Automated Reasoning, 7th International Conference, pp.25-42, 1955.
URL : https://hal.archives-ouvertes.fr/inria-00099178

G. Michaelson and K. Hammond, Hume : a functionally-inspired language for safetycritical systems, Draft Proc. 2nd Scottish Functional Programming Workshop, 2000.

G. Michaelson, K. Hammond, and J. Serot, The finite state-ness of FSM-hume, Draft paper submitted to TFP '03, Symposium on Trends in Functional Programming, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00103221

G. Michaelson, K. Hammond, and J. Serot, FSM-Hume, Proceedings of the 2004 ACM symposium on Applied computing , SAC '04, pp.1455-1461, 2004.
DOI : 10.1145/967900.968192
URL : https://hal.archives-ouvertes.fr/hal-00103221

R. Milner, Communication and concurrency, 1989.

R. Milner, The polyadic pi-calculus : a tutorial, Logic and Algebra of Specification, pp.203-246, 1993.

J. Moyen, System Presentation, Electronic Notes in Theoretical Computer Science, vol.59, issue.4, 2001.
DOI : 10.1016/S1571-0661(04)00300-7
URL : https://hal.archives-ouvertes.fr/inria-00100525

C. George and . Necula, Proof-carrying code, Conference Record of POPL '97 : The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.106-119, 1997.

H. B. Robert, B. P. Netzer, and . Miller, What are race conditions ? : Some issues and formalizations, ACM Lett. Program. Lang. Syst, vol.1, issue.1, pp.74-88, 1992.

W. O. Peter and . Hearn, Resources, concurrency, and local reasoning (abstract), ESOP, pp.1-2, 2004.

J. Reynolds, Separation logic: a logic for shared mutable data structures, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, 2002.
DOI : 10.1109/LICS.2002.1029817

F. Michael, D. Ringenburg, and . Grossman, Atomcaml : first-class atomicity via rollback, ICFP '05 : Proceedings of the tenth ACM SIGPLAN international conference on Functional programming, pp.92-104, 2005.

S. Savage, M. Burrows, G. Nelson, P. Sobalvarro, and T. Anderson, Eraser : a dynamic data race detector for multi-threaded programs, SOSP '97 : Proceedings of the sixteenth ACM symposium on Operating systems principles, pp.27-37, 1997.

M. Serrano, F. Boussinot, and B. Serpette, Scheme fair threads, Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming , PPDP '04, pp.203-214, 2004.
DOI : 10.1145/1013963.1013986

N. Shavit and D. Touitou, Software transactional memory, PODC '95 : Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, pp.204-213, 1995.
DOI : 10.1007/s004460050028
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.4743

J. Talpin and P. Jouvelot, The type and effect discipline, Seventh Annual IEEE Symposium on Logic in Computer Science, pp.162-173, 1992.

C. Von-praun and T. R. Gross, Object race detection, OOPSLA '01 : Proceedings of the 16th ACM SIGPLAN conference on Object oriented programming, systems, languages, and applications, pp.70-82, 2001.

A. Weiermann, Termination proofs by lexicographic path orderings yield multiply recursive derivation lengths, Theoretical Computer Science, vol.139, pp.335-362, 1995.

J. M. Wing, M. Faehndrich, J. Morrisett, and S. Nettles, Extensions to standard ml to support transactions, 1992.