Verifying Balanced Trees

DOI10.1007/978-3-540-72734-7_26zbMath1132.68351OpenAlexW2134829074MaRDI QIDQ5434520

Henny B. Sipma, Zohar Manna, 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)

Related Items (2)

Modular Termination and Combinability for Superposition Modulo Counter Arithmetic ⋮ Automata-based verification of programs with tree updates

This page was built for publication: Verifying Balanced Trees