Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits (Q670699): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Union-Find with Constant Time Deletions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying and Reasoning on Cost Annotations of Functional Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified Complexity (CerCo) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A program logic for resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: A type system with usage aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortised Resource Analysis with Separation Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: List processing in real time on a serial computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program verification through characteristic formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic formulae for the verification of imperative programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective interactive proofs for higher-order imperative programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource bound certification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lightweight semiformal time complexity analysis for purely functional data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved equivalence algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verified Characteristic Formulae for CakeML / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Resource Analysis with Polynomial Potential / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate amortized resource analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative Reasoning for Proving Lock-Freedom / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards automatic resource bound analysis for OCaml / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static prediction of heap space usage for first-order functional programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Merging Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tutorial on the universality and expressiveness of fold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iris / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order ghost state / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4005203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Essence of Higher-Order Concurrent Separation Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contract-based resource verification for higher-order functions with memoization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Coq Library for Internal Verification of Running-Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Predicates and Mutable ADTs in Hoare Type Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hoare type theory, polymorphism and separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ynot / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Complexity Verified / rank
 
Normal rank
Property / cites work
 
Property / cites work: Purely Functional Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top-Down Analysis of Path Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case Analysis of Set Union Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanical program analysis / rank
 
Normal rank

Latest revision as of 19:24, 18 July 2024

scientific article
Language Label Description Also known as
English
Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits
scientific article

    Statements

    Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits (English)
    0 references
    0 references
    0 references
    20 March 2019
    0 references
    verification
    0 references
    union-find
    0 references
    separation logic
    0 references
    time credits
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references