Write a Blog >>
Mon 20 Jan 2020 10:51 - 11:13 at Maurepas - Program verification Chair(s): Nikhil Swamy

Braun trees are functional data structures for implementing extensible arrays and priority queues (and sorting functions based on the latter) efficiently. Some well-known functions on Braun trees have not yet been verified, including especially Okasaki’s linear time conversion from lists to Braun trees. We supply the missing proofs and verify all of these algorithms in Isabelle, including non-obvious time complexity claims. In particular we provide the first linear-time conversion from Braun trees to lists. We also state and verify a new characterization of Braun trees as the trees t whose index set is the interval {1, … size of t}.

Mon 20 Jan
Times are displayed in time zone: Saskatchewan, Central America change

10:30 - 11:35: Program verificationCPP at Maurepas
Chair(s): Nikhil SwamyMicrosoft Research
10:30 - 10:51
Talk
CPP
Clement BlaudeauEcole Polytechnique, Natarajan ShankarSRI International, USA
DOI Pre-print Media Attached
10:51 - 11:13
Talk
CPP
Tobias NipkowTechnische Universität München, Thomas SewellChalmers University of Technology, Sweden
DOI Pre-print Media Attached
11:13 - 11:35
Talk
CPP
Thomas LetanANSSI, Yann Régis-GianasIRIF, University Paris Diderot and CNRS, France / INRIA PI.R2
DOI Pre-print Media Attached