Hoare Type Theory
-
Updated
Mar 28, 2017 - Coq
Hoare Type Theory
An implementation of the logic for verifying the correctness of cloud storage system in Coq
An implementation of separation logic in Coq
Sample Angular-enabled ASP.NET Core application with separated backend and frontend structure
Things that are needed for formally verifying a system
Google Summer of Code 2017 – Verification and Testing of Heap-based Programs with Symbolic PathFinder
One Of The Methodologies To Write Clean, Maintainable & Extensible Software
Test input generation using separation logic
Synthesis with Read-Only Borrows
Hoare Type Theory
Formalisation of Separation Logic and Mutability
Coq tactics for certification of the results of SSL-based program synthesis via the Verified Software Toolchain.
Coq tactics for certification of the results of SSL-based program synthesis via Iris logic.
Coq tactics for certification of the results of SSL-based program synthesis via Hoare Type Theory.
Strong non-interference for fine-grained concurrent programs
Voila is proof outline checker for fine-grained concurrency verification
Write readable Hoare style proof outlines for imperative programs in Agda.
Operational semantics, Type-based information flow security, Hoare logic, Verification conditions, and Separation logic in Agda for the IMP language
Test input generation using separation logic
Add a description, image, and links to the separation-logic topic page so that developers can more easily learn about it.
To associate your repository with the separation-logic topic, visit your repo's landing page and select "manage topics."