Verifying Balanced Trees

DOI10.1007/978-3-540-72734-7_26MaRDI QIDQ5434520zbMATH OpenOpenAlexFDO

Authors Zohar Manna, Henny B. Sipma, Ting Zhang

Publication date 4 January 2008

Published in Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72734-7_26

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Data structures (68P05)

Recommendations

• Verified Root-Balanced Trees
• Automata-based verification of programs with tree updates
• Tools and Algorithms for the Construction and Analysis of Systems
• Balancing weight-balanced trees
• Automatic functional correctness proofs for functional search trees

Cited in

(8)

• An assertional proof of red-black trees using Dafny
• Automatic functional correctness proofs for functional search trees
• Modular termination and combinability for superposition modulo counter arithmetic
• Balanced ordered trees
• Verified Root-Balanced Trees
• Computer Aided Verification
• Tools and Algorithms for the Construction and Analysis of Systems
• Automata-based verification of programs with tree updates

This page was built for publication: Verifying Balanced Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434520)