Resource control for synchronous cooperative threads

Theoretical Computer Science

Volumn 358, Issue 2-3, 2006, Pages 229-254

  Amadio, Roberto M ^a   Dal Zilio, Silvano ^b  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b AIX MARSEILLE UNIV   (France)

Author keywords

Bytecode verification; Quasi interpretations; Resource bound; Synchronous programming; Termination; Virtual machine

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; STANDARDS; SYNCHRONIZATION; VIRTUAL REALITY;

BYTECODE VERIFICATION; QUASI-INTERPRETATIONS; RESOURCE BOUND; SYNCHRONOUS PROGRAMMING; TERMINATION; VIRTUAL MACHINE;

RESOURCE ALLOCATION;

EID: 33746707566     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.01.017     Document Type: Article

References (28)

1. Amadio R. Max-plus quasi-interpretations. Proc. TLCA-6th Internat. Conf. Typed Lambda Calculi and Applications, Lecture Notes in Computer Science vol. 2701 (2003), Springer, Berlin
2. Amadio R. Synthesis of max-plus quasi-interpretations. Fund. Inform. 65 1-2 (2005) 29-60
3. Amadio R., Coupet-Grimal S., Dal-Zilio S., and Jakubiec L. A functional scenario for bytecode verification of resource bounds. Proc. CSL-Internat. Conf. Computer Science Logic, Lecture Notes in Computer Science vol. 3210 (2004), Springer, Berlin
4. Armstrong J., Virding R., Wikström C., and Williams M. Concurrent Programming in Erlang (1996), Prentice-Hall, Englewood Cliffs, NJ
5. Baader F., and Nipkow T. Term Rewriting and All That (1998), Cambridge University Press, Cambridge
6. Baillot P., and Mogbil V. Soft lambda calculus: a language for polynomial time computation. Proc. FOSSACS-7th Internat. Conf. Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science vol. 2987 (2004), Springer, Berlin
7. Bellantoni S., and Cook S. A new recursion-theoretic characterization of the poly-time functions. Comput. Complexity 2 (1992) 97-110
8. Berry G., and Gonthier G. The Esterel synchronous programming language. Sci. Comput. Programming 19 2 (1992) 87-152
9. Bonfante G., Marion J.-Y., and Moyen J.-Y. On termination methods with space bound certifications. Proc. Perspectives of System Informatics, Lecture Notes in Computer Science vol. 2244 (2001), Springer, Berlin
10. G. Bonfante, J.-Y. Marion, J.-Y. Moyen, Quasi-interpretations, Internal Report LORIA, November 2004, available from the authors.
11. Boudol G. ULM a core programming model for global computing. Proc. ESOP-13th European Symp. Programming, Lecture Notes in Computer Science vol. 2986 (2004), Springer, Berlin
12. Boussinot F., and De Simone R. The SL synchronous language. IEEE Trans. Software Eng. 22 4 (1996) 256-266
13. Carriero N., and Gelernter D. Linda in context. Comm. ACM 32 4 (1989) 444-458
14. Caspi P. Clocks in data flow languages. Theoret. Comput. Sci. 94 (1992) 125-140
15. Caspi P., and Pouzet M. Synchronous Kahn networks. Proc. ICFP-ACM SIGPLAN Internat. Conf. Functional Programming, SIGPLAN Notices vol. 31, no. 6 (1996), ACM Press, New York
16. Cobham A. The intrinsic computational difficulty of functions. Proc. Logic, Methodology, and Philosophy of Science II (1965), North Holland, Amsterdam
17. Hofmann M. The strength of non size-increasing computation. Proc. POPL-29th SIGPLAN-SIGACT Symp. Principles of Programming Languages (2002), ACM, New York
18. Jones N. Computability and Complexity, From a Programming Perspective (1997), MIT-Press, Cambridge, MA
19. Kahn G. The semantics of a simple language for parallel programming. Proc. IFIP Congress (1974), North-Holland, Amsterdam
20. Lee E., and Messerschmitt D. Static scheduling of synchronous data flow programs for digital signal. IEEE Trans. Comput. 1 (1987) 24-35
21. D. Leivant, Predicative recurrence and computational complexity i: word recurrence and poly-time, P. Clote, J. Remmel (Eds.), Feasible Mathematics II, Birkhäuser, Basel, 1994, pp. 320-343.
22. J.-Y. Marion, Complexité implicite des calculs, de la théorie à la pratique, Université de Nancy, Habilitation à diriger des recherches, 2000.
23. Morriset G., Walker D., Crary K., and Glew N. From system F to typed assembly language. ACM Trans. Programming Languages Systems 21 3 (1999) 528-569
24. Necula G. Proof carrying code. Proc. POPL-24th SIGPLAN-SIGACT Symp. Principles of Programming Languages (1997), ACM, New York
25. Odersky M. Functional nets. Proc. ESOP-9th European Symp. Programming, Lecture Notes in Computer Science vol. 1782 (2000), Springer, Berlin
26. J. Ousterhout, Why threads are a bad idea (for most purposes), Invited talk at the USENIX Technical Conference, 1996.
27. P. Puschner, A. Burns (Eds.), Real Time Systems 18(2/3), Special issue on Worst-case execution time analysis, 2000.
28. Reactive Programming, INRIA Sophia-Antipolis, Mimosa Project 〈http://www-sop.inria.fr/mimosa/rp〉.