9 citations · 22 across the 10 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LO2019
From LCF to Isabelle/HOL
Lawrence C. Paulson, Tobias Nipkow, Makarius Wenzel
Interactive theorem provers have developed dramatically over the past four decades, from primitive beginnings to today's powerful systems. Here, we focus on Isabelle/HOL and its di…
cs.DS2019★ 2 cited
Trustworthy Graph Algorithms
Mohammad Abdulaziz, Kurt Mehlhorn, Tobias Nipkow
The goal of the LEDA project was to build an easy-to-use and extendable library of correct and efficient data structures, graph algorithms and geometric algorithms. We report on th…