Author:
Hofmann Martin,Rodriguez Dulma
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Albert, E., Arenas, P., Genaim, S., Puebla, G.: Closed-Form Upper Bounds in Static Cost Analysis. Journal of Automated Reasoning (2010)
2. Lecture Notes in Computer Science;W.-N. Chin,2005
3. Gulwani, S., Mehra, K.K., Chilimbi, T.M.: SPEED: precise and efficient static estimation of program computational complexity. In: POPL. ACM (2009)
4. Lecture Notes in Computer Science;E. Albert,2008
5. Grobauer, B.: Topics in Semantics-based Program Manipulation. PhD thesis, BRICS Aarhus (2001)
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Automatic Amortized Resource Analysis with Regular Recursive Types;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
2. A High-Level Separation Logic for Heap Space under Garbage Collection;Proceedings of the ACM on Programming Languages;2023-01-09
3. A separation logic for heap space under garbage collection;Proceedings of the ACM on Programming Languages;2022-01-12
4. Type-based analysis of logarithmic amortised complexity;Mathematical Structures in Computer Science;2021-10-19
5. Automatic amortized resource analysis with the Quantum physicist’s method;Proceedings of the ACM on Programming Languages;2021-08-22