Funder
Deutsche Forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference47 articles.
1. Atkey, R.: Amortised resource analysis with separation logic. Log. Methods Comput. Sci. 7, 2 (2011)
2. Benzinger, R.: Automated higher-order complexity analysis. Theor. Comput. Sci. 318(1–2), 79–103 (2004)
3. Brinkop, H., Nipkow, T.: Pairing heap. Archive of Formal Proofs (2016). Formal proof development. http://isa-afp.org/entries/Pairing_Heap.html
4. Lecture Notes in Computer Science;Q Carbonneaux,2017
5. Charguéraud, A., Pottier, F.: Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits. J. Autom. Reason. To appear
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Liquid Amortization: Proving Amortized Complexity with LiquidHaskell (Functional Pearl);Proceedings of the 17th ACM SIGPLAN International Haskell Symposium;2024-08-28
2. Robust Resource Bounds with Static Analysis and Bayesian Inference;Proceedings of the ACM on Programming Languages;2024-06-20
3. Thunks and Debits in Separation Logic with Time Credits;Proceedings of the ACM on Programming Languages;2024-01-05
4. A Calculus for Amortized Expected Runtimes;Proceedings of the ACM on Programming Languages;2023-01-09
5. Modeling Asymptotic Complexity Using ACL2;Electronic Proceedings in Theoretical Computer Science;2022-05-24