Stream: Mirror: Isabelle Users Mailing List

Topic: [isabelle] On verification of predecessor query operations


view this post on Zulip Email Gateway (Apr 20 2026 at 20:52):

From: Jørgen Villadsen <cl-isabelle-users@lists.cam.ac.uk>

Dear Isabelle users, please consider the following message, which I submit on behalf of my student Vladimir Kalabukhov.


I am a Master’s student specializing in Automated Reasoning and Formal Verification. As part of my thesis, I am focusing on the verification of predecessor query operations for advanced data structures in the Isabelle/HOL proof assistant. The project centres on implementing standard trie traversal algorithm and the X-Fast Trie [1], which enable efficient predecessor queries over large key universes. The work involves defining the data structures, developing their core operations, formally proving their correctness, and analysing their runtime complexity, following the methodology presented in the Functional Data Structures and Algorithms book [2]. The objective is to produce an Isabelle formalization suitable for inclusion in the AFP [3]. This is my first project related to formal proofs in Isabelle. I would greatly appreciate any insights or suggestions regarding potential directions for this work.

References:
[1] https://en.wikipedia.org/wiki/X-fast_trie
[2] https://fdsa-book.net/
[3] https://www.isa-afp.org/topics/


Jørgen


Last updated: May 02 2026 at 13:17 UTC