16 research outputs found

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

    Get PDF
    Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018International audienceWe 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

    Guidelines for the use and interpretation of assays for monitoring autophagy (4th edition)

    Get PDF

    What sustains the multidrug resistance phenotype beyond ABC efflux transporters? Looking beyond the tip of the iceberg

    No full text
    corecore