A functional scenario for bytecode verification of resource bounds

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

Volumn 3210, Issue , 2004, Pages 265-279

  Amadio, Roberta M ^a   Coupet Grimal, Solange ^a   Zilio, Silvano Dal ^a   Jakubiec, Line ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BYTECODE VERIFICATION; EXPLICIT BOUNDS; FIRST-ORDER FUNCTIONAL LANGUAGES; FUNCTIONAL SCENARIOS; LEXICOGRAPHIC PATH ORDERS; QUASI-INTERPRETATION; RESOURCE BOUNDS; SPACE RESOURCES;

SPACE TIME CODES;

EID: 35048866460     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30124-0_22     Document Type: Article

References (17)

1. M. Abadi and R. Stata. A type system for Java bytecode subroutines. In Proc. POPL, 1998.
2. R. Amadio. Max-plus quasi-interpretations. In Proc. TLCA, Springer LNCS 2701, 2003.
3. R. Amadio, S. Coupet-Grimal, S. Dal Zilio and L. Jakubiec. A functional scenario for bytecode verification of resource bounds. Research Report LIF 17-2004.
4. S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the poly-time functions. Computational Complexity, 2:97-110, 1992.
5. G. Bonfante, J.-Y. Marion and J.-Y. Moyen. On termination methods with space bound certifications. In Proc. Perspectives of System Informatics, Springer LNCS 2244, 2001.
6. F. Baader and T. Nipkow. Term rewriting and all that. Cambridge University Press, 1998.
7. A. Cobham. The intrinsic computational difficulty of functions. In Proc. Logic, Methodology, and Philosophy of Science II, North Holland, 1965.
8. M. Hofmann. The strength of non size-increasing computation. In Proc. POPL, 2002.
9. N. Jones. Computability and complexity, from a programming perspective. MIT-Press, 1997.
10. G. Kildall, A unified approach to global program optimization. In Proc. POPL, 1973.
11. D. Leivant. Predicative recurrence and computational complexity i: word recurrence and poly-time. Feasible mathematics II, Clote and Remmel (eds.), Birkhäuser, 1994.
12. T. Lindholm and F. Yellin. The Java virtual machine specification. Addison-Wesley, 1999.
13. . J.-Y. Marion. Complexité implicite des calculs, de la théorie à la pratique. Habilitation à diriger des recherches, Université de Nancy, 2000.
14. J.-Y. Marion, J.-Y. Moyen. Termination and resource analysis of assembly programs by Petri Nets. Technical Report, Université de Nancy, 2003.
15. 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.
16. G. Necula. Proof carrying code. In Proc. POPL, 1997.
17. D. Sannella. Mobile resource guarantee. IST-Global Computing research proposal, U. Edinburgh, 2001. http : //www.des.ed.ac.uk/home/mrg/.