Completeness of the Iris separation logic framework
-
Updated
Feb 5, 2026 - Rocq Prover
Completeness of the Iris separation logic framework
Visualised process of the weakest precondition's computing
An attempt to apply formal methods (D. Gries style) to specification and verification of code-writting tasks for CS students.
Concolic Weakest Precondition as a Lens ¯\_(ツ)_/¯
A repository that describes my explorations on formal verification using Dafny, techniques from programming language theory such as CYK parsing, Earley parsing, type-theoretic things like lambda calculus etc.
Isabelle/HOL theories for the paper "Backwards and Forwards with Separation Logic".
The goal of this project is to bring most of Event-B and refinement calculus into Python
TPs de la materia Algoritmos y Estructuras de Datos II, UBA-FCEN
Problem specification - Specification languages - Loop invariant - Weakest precondition - Testing - Searching algorithms - Sorting algorithms - Big O notation -
Add a description, image, and links to the weakest-preconditions topic page so that developers can more easily learn about it.
To associate your repository with the weakest-preconditions topic, visit your repo's landing page and select "manage topics."