Collections Framework

MaRDI QIDQ7361918FDO

Authors Peter Lammich, Andreas Lochbihler

Publication date 25 November 2009

Cites work

• CONCUR 2005 – Concurrency Theory
• Imperative Functional Programming with Isabelle/HOL
• The Isabelle collections framework

Cited in

(18)

• Kruskal's Algorithm for Minimum Spanning Forest
• Verified Construction of Static Single Assignment Form
• Gale-Shapley Algorithm
• Dijkstra's Shortest Path Algorithm
• Jinja with Threads
• A Separation Logic Framework for Imperative HOL
• The Imperative Refinement Framework
• Transition Systems and Automata
• Light-weight Containers
• A Sequent Calculus Prover for First-Order Logic with Functions
• The CAVA Automata Library
• Abstract Completeness
• Algorithms for Reduced Ordered Binary Decision Diagrams
• Deriving class instances for datatypes
• Making Arbitrary Relational Calculus Queries Safe-Range
• Knuth–Morris–Pratt String Search
• Ordinary Differential Equations
• Tree Automata

This page was built for software: Collections Framework