1. Fast Formal Proof of the Erdős–Szekeres Conjecture for Convex Polygons with at Most 6 Points

   • Filip Marić

   OriginalPaper 05 September 2017 Pages: 301 - 329

   

2. Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits

   • Arthur Charguéraud
   • François Pottier

   OriginalPaper 22 September 2017 Pages: 331 - 365

   

3. Amortized Complexity Verified

   • Tobias Nipkow
   • Hauke Brinkop

   OriginalPaper 13 March 2018 Pages: 367 - 391

4. Extraction of Expansion Trees

   • Alexander Leitsch
   • Anela Lolic

   OriginalPaper Open access 27 January 2018 Pages: 393 - 430