Author:
Frohn Florian,Giesl Jürgen
Publisher
Springer International Publishing
Reference25 articles.
1. Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Cost analysis of object-oriented bytecode programs. Theor. Comp. Sci. 413(1), 142–159 (2012)
2. AProVE.
https://aprove-developers.github.io/jbc-complexity/
3. Atkey, R.: Amortised resource analysis with separation logic. Logical Methods Comput. Sci. 7(2) (2011)
4. Lecture Notes in Computer Science;M Avanzini,2016
5. Lecture Notes in Computer Science;M Brockschmidt,2010
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. When COSTA Met KeY: Verified Cost Bounds;The Logic of Software. A Tasting Menu of Formal Methods;2022
2. Improving Automatic Complexity Analysis of Integer Programs;The Logic of Software. A Tasting Menu of Formal Methods;2022
3. Verifying Time Complexity of Binary Search using Dafny;Electronic Proceedings in Theoretical Computer Science;2021-08-06
4. ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs;Theoretical Aspects of Computing – ICTAC 2021;2021
5. Runtime Complexity Analysis of Logically Constrained Rewriting;Logic-Based Program Synthesis and Transformation;2021