Mohammad Abdulaziz

Isabelle-Graph-Library

Thomas Ammer, Mohammad Abdulaziz, Adem Rimpapa, Christoph Madelener et autres

# Isabelle-Graph-Library A formal mathematical library covering results in graph theory, with a focus on graph algorithms and results from combinatorial optimisation.Results include: - A set-based simple representation of graphs (both directed and undirected). In this representation, we tried to port as …

nl (code pays fourni par la source)

Isabelle-Graph-Library

Thomas Ammer, Mohammad Abdulaziz, Adem Rimpapa, Christoph Madelener et autres

# Isabelle-Graph-Library A formal mathematical library covering results in graph theory, with a focus on graph algorithms and results from combinatorial optimisation.Results include: - A set-based simple representation of graphs (both directed and undirected). In this representation, we tried to port as …

nl (code pays fourni par la source)

Testing the Verifier: Automated Testing for Isabelle (Artifact, Working Paper)

Enzo Bestetti, Bartosz G�owacki, Aravinth Kaneshalingam, 徐江晶 et autres

Isabelle Testing Project -- Findings Summary This document summarises the findings reported in "Testing the Verifier: Automated Testing for Isabelle" together with the project ownership mapping used in this repository. Abstract. This initial report summarises the investigation and gives each student space …

gb (code pays fourni par la source)

Testing the Verifier: Automated Testing for Isabelle (Artifact, Working Paper)

Enzo Bestetti, Bartosz G�owacki, Aravinth Kaneshalingam, 徐江晶 et autres

Isabelle Testing Project -- Findings Summary This document summarises the findings reported in "Testing the Verifier: Automated Testing for Isabelle" together with the project ownership mapping used in this repository. Abstract. This initial report summarises the investigation and gives each student space …

gb (code pays fourni par la source)

Safe Agentic Workflows for Isabelle

Maximilian Schäffeler, Lukas Stevens, Kevin Kappelmann, Mohammad Abdulaziz et autres

Experimental setups for safe agentic workflows for Isabelle.

de, gb, dk (code pays fourni par la source)

Safe Agentic Workflows for Isabelle

Maximilian Schäffeler, Lukas Stevens, Kevin Kappelmann, Mohammad Abdulaziz et autres

Experimental setups for safe agentic workflows for Isabelle.

de, gb, dk (code pays fourni par la source)

Formal Primal-Dual Algorithm Analysis

Mohammad Abdulaziz, Thomas Ammer, Christoph Madlener

We present an ongoing effort to build a framework and a library in Isabelle/HOL for formalising primal-dual arguments for the analysis of algorithms. We discuss a number of example formalisations from the theory of matching algorithms, covering classical algorithms like the Hungarian …

Formal Primal-Dual Algorithm Analysis

Mohammad Abdulaziz, Thomas Ammer, Christoph Madlener

We present an ongoing effort to build a framework and a library in Isabelle/HOL for formalising primal-dual arguments for the analysis of algorithms. We discuss a number of example formalisations from the theory of matching algorithms, covering classical algorithms like the Hungarian …

gb (code pays fourni par la source)

Just Type It in Isabelle! AI Agents Drafting, Mechanizing, and Generalizing from Human Hints

Kevin Kappelmann, Maximilian Schäffeler, Lukas Stevens, Mohammad Abdulaziz et autres

Type annotations are essential when printing terms in a way that preserves their meaning under reparsing and type inference. We study the problem of complete and minimal type annotations for rank-one polymorphic $λ$-calculus terms, as used in Isabelle. Building on prior work …

Just Type It in Isabelle! AI Agents Drafting, Mechanizing, and Generalizing from Human Hints

Kevin Kappelmann, Maximilian Schäffeler, Lukas Stevens, Mohammad Abdulaziz et autres

Type annotations are essential when printing terms in a way that preserves their meaning under reparsing and type inference. We study the problem of complete and minimal type annotations for rank-one polymorphic $λ$-calculus terms, as used in Isabelle. Building on prior work …

gb, dk (code pays fourni par la source)

A Formal Correctness Proof of Edmonds’ Blossom Shrinking Algorithm

Mohammad Abdulaziz, Kurt Mehlhorn

Abstract We present the first formal correctness proof of Edmonds’ blossom shrinking algorithm for maximum cardinality matching in general graphs. We focus on formalising the mathematical structures and properties that allow the algorithm to run in worst-case polynomial running time. We formalise …

gb, de (code pays fourni par la source)

A Formal Analysis of Capacity Scaling Algorithms for Minimum-Cost Flows

Mohammad Abdulaziz, Thomas Ammer

We present formalisations of the correctness of executable algorithms to solve minimum-cost flow problems in Isabelle/HOL. Two of the algorithms are based on the technique of scaling, most notably Orlin's algorithm, which has the fastest known running time for solving the problem …