Feasible Reactivity for Synchronous Cooperative Threads

Electronic Notes in Theoretical Computer Science

Volumn 154, Issue 3, 2006, Pages 33-43

  Amadio, Roberto M ^a   Dabrowski, Frédéric ^b  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b INRIA   (France)

Author keywords

Polynomial time; Quasi interpretations; Resource bounds; Synchronous and cooperative programming; Termination

Indexed keywords

COOPERATIVE THREADS; POLYNOMIAL TIME; QUASI-INTERPRETATIONS; RESOURCE BOUNDS; SYNCHRONOUS AND COOPERATIVE PROGRAMMING; TERMINATION;

COMPUTATION THEORY; COMPUTER PROGRAMMING; MATHEMATICAL MODELS; PARAMETER ESTIMATION; POLYNOMIALS;

SYNCHRONOUS GENERATORS;

EID: 33745951648     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.05.005     Document Type: Article

References (13)

1. Amadio R., and Dal-Zilio S. Resource control for synchronous cooperative threads. Proc. CONCUR. SLNCS 3170 (2004) Extended version to appear in Theoretical Computer Science
2. Amadio R. Max-plus quasi-interpretations. Proc. of TLCA. Springer LNCS 2701 (2003)
3. Amadio R. Synthesis of max-plus quasi-interpretations. Fundamenta Informaticae 65 1-2 (2005) 29-60
4. Baader F., and Nipkow T. Term rewriting and all that (1998), Cambridge University Press
5. L. Mandel and M. Pouzet. Reactive ML, a reactive extension to ML. In Proc. ACM PPDL, 2005
6. Bonfante G., Marion J.-Y., and Moyen J.-Y. On termination methods with space bound certifications. Proc. PSI. SLNCS 2244 (2001)
7. G. Bonfante, J.-Y. Marion, and J.-Y. Moyen. Quasi-interpretations. Draft November 2004. Available from the authors
8. Boussinot F., and De Simone R. The SL Synchronous Language. IEEE Trans. on Software Engineering 22 4 (1996) 256-266
9. Cook S. Characterizations of pushdown machines in terms of time-bounded computers. Journal of the ACM 18 1 (1971) 4-18
10. C. Lee, N. Jones, and A. Ben-Amram. The size-change principle for program termination. In Proc. ACM POPL, 2001
11. J.-Y. Marion. Complexité implicite des calculs, de la théorie à la pratique. Université de Nancy. Habilitation à diriger des recherches, 2000
12. J. Ousterhout. Why threads are a bad idea (for most purposes). Invited talk at the USENIX Technical Conference, 1996
13. Reactive Programming, INRIA Sophia-Antipolis, Mimosa Project. http://www-sop.inria.fr/mimosa/rp