Author:
Albert E.,Arenas P.,Genaim S.,Gómez-Zamalloa M.,Puebla G.,Ramírez D.,Román G.,Zanardini D.
Subject
General Computer Science,Theoretical Computer Science
Reference10 articles.
1. Termination Analysis of Java Bytecode;Albert,2008
2. Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis;Albert,2008
3. E. Albert, P. Arenas, S. Genaim, and G. Puebla. Dealing with numeric fields in termination analysis of java-like languages. In FTfJP, 2008
4. Cost Analysis of Java Bytecode;Albert,2007
5. E. Albert, S. Genaim, and M. Gómez-Zamalloa. Live Heap Space Analysis for Languages with Garbage Collection. In ISMM'09: Proceedings of the 8th international symposium on Memory management, New York, NY, USA, June 2009. ACM Press
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Asparagus: Automated Synthesis of Parametric Gas Upper-Bounds for Smart Contracts;Proceedings of the ACM on Programming Languages;2023-10-16
2. Mechanized Proofs of Adversarial Complexity and Application to Universal Composability;ACM Transactions on Privacy and Security;2023-07-19
3. Fine-Tuning Data Structures for Query Processing;Proceedings of the 21st ACM/IEEE International Symposium on Code Generation and Optimization;2023-02-17
4. Execution Time Program Verification with Tight Bounds;Practical Aspects of Declarative Languages;2023
5. Mechanized Proofs of Adversarial Complexity and Application to Universal Composability;Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security;2021-11-12