Resource bound certification for a tail-recursive virtual machine

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3780 LNCS, Issue , 2005, Pages 247-263

  Dal Zilio, Silvano ^a   Gascon, Régis ^b  

^a CNRS   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CONSTRAINT THEORY; DIGITAL ARITHMETIC; OPTIMIZATION; PARAMETER ESTIMATION; PATTERN MATCHING; SUPERVISORY AND EXECUTIVE PROGRAMS;

ARITHMETICAL CONSTRAINTS; BYTECODE PROGRAMS; OPTIMIZED PROGRAMS; STATIC ANALYSES;

VIRTUAL REALITY;

EID: 33646734276     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11575467_17     Document Type: Conference Paper

References (18)

1. R. Amadio, S. Coupet-Grimal, S. Dal Zilio and L. Jakubiec. A functional scenario for bytecode verification of resource bounds. In International Conference on Computer Science Logic (CSL), LNCS, vol. 3210, Springer, 2004.
2. R. Amadio and S. Dal Zilio. Resource control for synchronous cooperative threads. In 15th International Conference on Concurrency Theory (CONCUR), LNCS vol. 3170, Springer, 2004.
3. R. Amadio. Max-plus quasi-interpretations. In 6th International Conference on Typed Lambda Calculi and Applications (TLCA), LNCS vol. 2701, Springer, 2003.
4. R. Amadio. Synthesis of max-plus quasi-interpretations. Fundamenta Informaticae, 65(1-2):29-60, 2005.
5. S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97-110, 1992.
6. A. Cobham. The intrinsic computational difficulty of functions. In Proceedings Logic, Methodology, and Philosophy of Science II, North Holland, 1965.
7. K. Crary and S. Weirich. Resource bound certification. In Principles of Programming Languages (POPL). ACM, 2000.
8. S. Dal Zilio and R. Gascon. Resource Bound Certification for a Tail-Recusive Virtual Machine. LIF Research Report 26, 2005.
9. M. Hofmann. The strength of non size-increasing computation. In Principles of Programming Languages (POPL), ACM, 2002.
10. N. Jones. Computability and complexity, from a programming perspective. MIT-Press, 1997.
11. T. Lindholm and F. Yellin. The Java virtual machine specification. Addison-Wesley, 1999.
12. J.-Y. Marion. Complexité implicite des calculs, de la théorie à la pratique. Habilitation à diriger des recherches, Université de Nancy, 2000.
13. J.-Y. Marion and J.-Y. Moyen. Termination and resource analysis of assembly programs by Petri Nets. Technical Report, Université de Nancy, 2003.
14. G. Morriset, D. Walker, K. Crary and N. Glew. From system F to typed assembly language. In ACM Transactions on Programming Languages and Systems, 21(3):528-569, 1999.
15. D. Sannella. Mobile Resource Guarantee. IST-Global Computing research project, 2001. http://www.des.ed.ac.uk/home/mrg/.
16. G. Kildall. A unified approach to global program optimization. In Principles of Programming Languages (POPL). ACM, 1973.
17. G. Necula. Proof-carrying code. In Principles of Programming Languages (POPL). ACM, 1997.
18. M. Tofte and J.-P. Talpin. Region-Based Memory Management. In Information and Computation, 132(2):109-176, 1997.