Automatic Functional Correctness Proofs for Functional Search Trees (Q2829265): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(12 intermediate revisions by 5 users not shown)
Property / cites work
 
Property / cites work: Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric binary B-trees: Data structure and maintenance algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Languages and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Refinement in Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Purely Functional 1-2 Brother Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of correctness of data representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming with Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Red-black trees with types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2850669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4725724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Complexity Verified / 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: Q4096430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-2 Brother Trees or AVL Trees Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced trees with removals: An exercise in rewriting and proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864245 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Isabelle/HOL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ACL2 / rank
 
Normal rank
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: HOL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Archive Formal Proofs / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AVL trees / 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: Amortized Complexity / 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/978-3-319-43144-4_19 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2483569599 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:31, 12 July 2024

scientific article
Language Label Description Also known as
English
Automatic Functional Correctness Proofs for Functional Search Trees
scientific article

    Statements

    Automatic Functional Correctness Proofs for Functional Search Trees (English)
    0 references
    0 references
    27 October 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers