Amortized complexity verified (Q670702): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Isabelle / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Skew Heap / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Splay Tree / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PairingHeap / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Amortized Complexity / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Root Balanced Tree / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10817-018-9459-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2934015820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortised Resource Analysis with Separation Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated higher-order complexity analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated resource analysis with Coq proof objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits / 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: Q3619797 / 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: Denotational cost semantics for functional languages with inductive types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic average-case analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pairing heap: A new form of self-adjusting heap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Pairing Heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Code Generation via Higher-Order Rewrite Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying Nonlinear Real Formulas Via Sums of Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automating program analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate amortized resource analysis / 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: Static prediction of heap space usage for first-order functional programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A verified compiler from Isabelle/HOL to CakeML / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The derivation of a tighter bound for top-down skew heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Recursive Functions in Higher-Order Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: CakeML / 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: Amortized Complexity Verified / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Functional Correctness Proofs for Functional Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verified Root-Balanced Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concrete Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Purely Functional Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A systematic analysis of splaying / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Adjusting Heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of Functional Languages / 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
Amortized complexity verified
scientific article

    Statements

    Amortized complexity verified (English)
    0 references
    0 references
    0 references
    20 March 2019
    0 references
    amortized complexity
    0 references
    interactive verification
    0 references
    functional programming
    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