On the Limits of the Classical Approach to Cost Analysis-Reference-Cited by-同舟云学术

On the Limits of the Classical Approach to Cost Analysis

Published:2012 Issue: Volume: Page:405-421
ISSN:0302-9743
Container-title:Static Analysis
language:
Short-container-title:

Author:

Alonso-Blas Diego Esteban,Genaim Samir

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-33125-1_27.pdf

Reference23 articles.

1. Albert, E., Arenas, P., Genaim, S., Puebla, G.: Closed-Form Upper Bounds in Static Cost Analysis. Journal of Automated Reasoning 46(2), 161–203 (2011)

2. Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Cost Analysis of Object-Oriented Bytecode Programs. Theoretical Computer Science 413(1), 142–159 (2012)

3. Albert, E., Genaim, S., Gómez-Zamalloa, M.: Parametric Inference of Memory Requirements for Garbage Collected Languages. In: ISMM, pp. 121–130. ACM, New York (2010)

4. Lecture Notes in Computer Science;E. Albert,2011

5. Lecture Notes in Computer Science;H. Anderson,2005

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Novel and Lightweight Real-Time Continuous Motion Gesture Recognition Algorithm for Smartphones;IEEE Access;2023

2. Runtime Complexity Bounds Using Squeezers;ACM Transactions on Programming Languages and Systems;2022-07-15

3. Type-based analysis of logarithmic amortised complexity;Mathematical Structures in Computer Science;2021-10-19

4. ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures;Computer Aided Verification;2021

5. Run-time Complexity Bounds Using Squeezers;Programming Languages and Systems;2021