Collections Dependents

2022

Making Arbitrary Relational Calculus Queries Safe-Range

by Martin Raszyk and Dmitriy Traytel

Sep 28

A Sequent Calculus Prover for First-Order Logic with Functions

by Asta Halkjær From and Frederik Krogsdal Jacobsen

Jan 31

2021

Gale-Shapley Algorithm

by Tobias Nipkow

Dec 29

2019

Kruskal's Algorithm for Minimum Spanning Forest

by Maximilian P. L. Haslbeck, Peter Lammich and Julian Biendarra

Feb 14

2017

Transition Systems and Automata

by Julian Brunner

Oct 19

2016

The Imperative Refinement Framework

by Peter Lammich

Aug 08

Algorithms for Reduced Ordered Binary Decision Diagrams

by Julius Michaelis, Max W. Haslbeck, Peter Lammich and Lars Hupel

Apr 27

Verified Construction of Static Single Assignment Form

by Sebastian Ullrich and Denis Lohner

Feb 05

2015

Deriving class instances for datatypes

by Christian Sternagel and René Thiemann

Mar 11

2014

The CAVA Automata Library

by Peter Lammich

May 28

Abstract Completeness

by Jasmin Christian Blanchette, Andrei Popescu and Dmitriy Traytel

Apr 16

2013

Light-weight Containers

by Andreas Lochbihler

Apr 15

2012

A Separation Logic Framework for Imperative HOL

by Peter Lammich and Rene Meis

Nov 14

Ordinary Differential Equations

by Fabian Immler and Johannes Hölzl

Apr 26

Dijkstra's Shortest Path Algorithm

by Benedikt Nordhoff and Peter Lammich

Jan 30

2011

Executable Transitive Closures of Finite Relations

by Christian Sternagel and René Thiemann

Mar 14

2009

Tree Automata

by Peter Lammich

Nov 25

Collections Framework

by Peter Lammich

Nov 25

2007

Jinja with Threads

by Andreas Lochbihler

Dec 03