Complexity verification using guided theorem enumeration

DOI10.1145/3009837.3009864zbMath1380.68284OpenAlexW2565511473MaRDI QIDQ5370898

Burak Sahin, William R. Harris, Akhilesh Srikanth

Publication date: 20 October 2017

Published in: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3009837.3009864

zbMATH Keywords

interpolationcomplexitytheorem grounding

Mathematics Subject Classification ID

Related Items (2)

Unnamed Item ⋮ Inferring expected runtimes of probabilistic integer programs using expected sizes

Uses Software

• z3
• Soot
• CAMPY
• LeetCode

This page was built for publication: Complexity verification using guided theorem enumeration