A Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program Verification - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

A Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program Verification

Résumé

We present a framework for simultaneously verifying the functional correctness and the worst-case asymptotic time complexity of higher-order imperative programs. We build on top of Separation Logic with Time Credits, embedded in an interactive proof assistant. We formalize the O notation, which is key to enabling modular specifications and proofs. We cover the subtleties of the multivariate case, where the complexity of a program fragment depends on multiple parameters. We propose a way of integrating complexity bounds into specifications, present lemmas and tactics that support a natural reasoning style, and illustrate their use with a collection of examples.
Fichier principal
Vignette du fichier
gueneau-chargeraud-pottier-esop2018.pdf (423.86 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01926485 , version 1 (19-11-2018)

Identifiants

Citer

Armaël Guéneau, Arthur Charguéraud, François Pottier. A Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program Verification. ESOP 2018 - 27th European Symposium on Programming, Apr 2018, Thessaloniki, Greece. ⟨10.1007/978-3-319-89884-1_19⟩. ⟨hal-01926485⟩
93 Consultations
80 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More