Certified Complexity (CerCo)

DOI10.1007/978-3-319-12466-7_1zbMath1445.68057OpenAlexW2172426415MaRDI QIDQ3460499

Claudio Sacerdoti Coen, Brian A. Campbell, Jaap P. Boender, Ilias Garnier, Paolo Tranquilli, Randy Pollack, Nicolas Ayache, Mauro Piccolo, Antoine Madet, James McKinna, Roberto M. Amadio, Yann Régis-Gianas, François Bobot, I. Stark, Dominic P. Mulligan

Publication date: 7 January 2016

Published in: Foundational and Practical Aspects of Resource Analysis (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/17744654/fopara13_author_final.pdf

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of compilers and interpreters (68N20) Theory of software (68N99)

Related Items (3)

Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation ⋮ Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits ⋮ The verified CakeML compiler backend

This page was built for publication: Certified Complexity (CerCo)