Resource analysis by sup-interpretation

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

Volumn 3945 LNCS, Issue , 2006, Pages 163-176

  Marion, Jean Yves ^a   Péchoux, Romain ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; DATA STORAGE EQUIPMENT; FUNCTIONS; PATTERN MATCHING; POLYNOMIALS;

FUNCTION OUTPUTS; NON-TERMINATING PROGRAMS; RESOURCE ANALYSIS; SUP-INTERPRETATION;

RESOURCE ALLOCATION;

EID: 33745840787     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11737414_12     Document Type: Conference Paper

References (23)

1. R. Amadio. Max-plus quasi-interpretations. In Martin Hofmann, editor, Typed Lambda Calculi and Applications, 6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings, volume 2701 of Lecture Notes in Computer Science, pages 31-45. Springer, 2003.
2. R. Amadio, S. Coupet-Grimal, S. Dal-Zilio, and L. Jakubiec. A functional scenario for bytecode verification of resource bounds. In Jerzy Marcinkowski and Andrzej Tarlecki, editors, Computer Science Logic, 18th International Workshop, CSL 13th Annual Conference of the EACSL, Karpacz, Poland, volume 3210 of Lecture Notes in Computer Science, pages 265-279. Springer, 2004.
3. R. Amadio and S. Dal Zilio. Resource control for synchronous cooperative threads. Research Report LIF.
4. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133-178, 2000.
5. D. Aspinall and A. Compagnoni. Heap bounded assembly language. Journal of Automated Reasoning (Special Issue on Proof-Carrying Code), 31:261-302, 2003.
6. R. Benzinger. Automated higher-order complexity analysis. Theoretical Computer Science, 318(1-2):79-103, 2004.
7. M. Blum. A machine-independent theory of the complexity of recursive functions. Journal of the Association for Computing Machinery, 14:322-336, 1967.
8. G. Bonfante, A. Cichon, J.-Y. Marion, and H. Touzet. Algorithms with polynomial interpretation termination proof. Journal of Functional Programming, 11(1):33-53, 2001.
9. G. Bonfante, J.-Y. Moyen J.-Y. Marion, and R. Péchoux. Synthesis of quasi-interpretations. Workshop on Logic and Complexity in Computer Science, LCC2005, Chicago, 2005. http://www.loria/~pechoux.
10. G. Bonfante, J.-Y, Marion, and J.-Y. Moyen. On lexicographic termination ordering with space bound certifications. In Dines Bjørner, Manfred Broy, and Alexandre V. Zamulin, editors, Perspectives of System Informatics, 4th International Andrei Ershov Memorial Conference, PSI 2001, Akademgorodok, Novosibirsk, Russia, Ershov Memorial Conference, volume 2244 of Lecture Notes in Computer Science. Springer, Jul 2001.
11. G. Bonfante, J.-Y. Marion, and J.-Y. Moyen. Quasi-interpretation a way to control resources. Submitted to Theoretical Computer Science, 2005. http://www.loria.fr/~moyen/appsemTCS.ps.
12. S.K. Debray and N.W. Lin. Cost analysis of logic programs. ACM Transactions on Programming Languages and Systems, 15(5):826-875, 1993.
13. N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, pages 69-115, 1987.
14. S.G. Frankau and A. Mycroft. Stream processing hardware from functional language specifications. In Martin Hofmann, editor, 36th Hawai'i International Conference on System Sciences (HICSS 36). IEEE, 2003.
15. M. Hofmann. Linear types and non-size-increasing polynomial time computation. In Proceedings of the Fourteenth IEEE Symposium on Logic in Computer Science (LICS'99), pages 464-473, 1999.
16. M. Hofmann. A type system for bounded space and functional in-place update. In European Symposium on Programming, ESOP'00, volume 1782 of Lecture Notes in Computer Science, pages 165-179, 2000.
17. A. Hugh and S.C. Khoo. Affined-based size-change termination. APLAS 2003, Beijing, 2003.
18. D.S. Lankford. On proving term rewriting systems are noetherien. Technical report, 1979.
19. Chin Soon Lee, Neil D. Jones, and Amir M. Ben-Amram. The size-change principle for program termination. In Symposium on Principles of Programming Languages, volume 28, pages 81-92. ACM press, January 2001.
20. S. Lucas. Polynomials over the reals in proofs of termination: from theory to practice. RAIRO Theoretical Informatics and Applications, 39(3):547-586, 2005.
21. J.-Y. Marion and J.-Y. Moyen. Efficient first order functional program interpreter with time bound certifications. In Michel Parigot and Andrei Voronkov, editors, Logic for Programming and Automated Reasoning, 7th International Conference, LPAR 2000, Reunion Island, France, volume 1955 of Lecture Notes in Computer Science, pages 25-42. Springer, Nov 2000.
22. J. Regehr. Say no to stack overflow. 2004. http://www.embedded.com.
23. R. Thiemann and J. Giesl. Size-change termination for term rewriting. In 14th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, Valencia, Spain, 2003. Springer.