Complexity verification using guided theorem enumeration

From MaRDI portal

Revision as of 00:36, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5370898

Jump to:navigation, search

DOI10.1145/3009837.3009864zbMath1380.68284OpenAlexW2565511473WikidataQ131117542 ScholiaQ131117542MaRDI 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

interpolation complexity theorem grounding

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

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

Uses Software

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5370898&oldid=20079777"