More on HOL Light - Lecture 2
Explore advanced concepts and applications of HOL Light theorem prover with expert Freek Wiedijk in this in-depth continuation of the series.
Lean-HoG: Incorporating a Database of Graphs into a Proof Assistant
Explore the integration of a graph database into a proof assistant, enhancing mathematical reasoning capabilities and streamlining complex proofs in formal verification.
Proof-driven Development of Production-quality Cryptographic Software
Explore formal verification in cryptographic software development, focusing on Fiat Cryptography's innovative approach to achieving expert-level performance with comprehensive computer-checked proofs and specializing compilation.
High-Assurance Go Cryptography - Ensuring Safety in Cryptographic Libraries
Explore techniques for ensuring safety and reliability in Go's cryptography standard library, including testing, fuzzing, and formal proofs.
HOL with Dependent Types and Subtyping
Explore advanced type theory concepts combining Higher-Order Logic, dependent types, and subtyping for enhanced formal reasoning and theorem proving capabilities.
Provable Security - Eurocrypt 2024
Explore cutting-edge cryptographic research on provable security at Eurocrypt 2024, featuring expert presentations and discussions on advanced theoretical concepts and practical applications.
The Proofgold Blockchain: Integrating Formal Proofs with Cryptocurrency
Explore the innovative Proofgold blockchain system, its applications in mathematics and formal verification, and its potential impact on decentralized proof-checking and cryptocurrency.
Impromptu Chat About Hahn-Banach Theorem in Lean
Explore the intricacies of HB implementation in Lean with Mario Carneiro in this impromptu discussion, gaining insights into advanced mathematical formalization techniques.
ARMOR: A Formally Verified Implementation of X.509 Certificate Chain Validation - 2024
Explore a formally verified implementation of X.509 certificate chain validation, enhancing security and reliability in digital certificate systems.
CryptOpt: Verified Compilation with Randomized Program Search for Cryptographic Primitives
Explore CryptOpt, a verified compilation pipeline for cryptographic primitives that generates high-performance assembly code with formal proofs, outperforming GCC and Clang for specific applications.
VMSL: A Separation Logic for Mechanised Robust Safety of Virtual Machines Communicating Above FF-A
Explore VMSL, a novel separation logic for reasoning about virtual machine communication and security in hypervisor systems, with focus on Arm's FF-A hypercall ABIs.
Putting Weak Memory in Order via a Promising Intermediate Representation
Explore an in-order shared-memory concurrency model for C/C++, supporting non-atomic accesses and compiler optimizations while maintaining soundness between source and intermediate representation.
Proving Capability Safety in the Presence of Indirect Sentries
Explore capability safety proofs with indirect sentries, advancing understanding of secure programming models and language design.
Specifying Smart Contracts with Hax and ConCert
Explore high-assurance smart contracts using Hax toolchain and ConCert for embedding, specifying security properties, and verification in Rust.
Mostly Automated Proof Repair for Verified Libraries
Explore automated proof repair for higher-order imperative functions, combining dynamic program alignment, enumerative invariant synthesis, and proof-driven testing to maintain verified software efficiently.
Fair Operational Semantics - Theory for Expressing and Reasoning About Fairness Properties
Explore Fair Operational Semantics (FOS), a novel theory for expressing and reasoning about fairness properties in program verification, with applications in concurrent systems and weak memory models.
Formally Verified Samplers from Probabilistic Programs with Loops and Conditioning
Explore Zar: a verified compiler for discrete probabilistic programs, transforming cpGCL to executable samplers. Learn about choice-fix trees, interaction trees, and sampling equidistribution theorem.
Merging Inductive Relations for Improved Program Specification
Explore an algorithm for merging inductive relations, improving automatic generation performance and simplifying mechanized proofs in proof engineering tools like QuickChick for Coq.
CQS: A Formally-Verified Framework for Fair and Abortable Synchronization
Explore a formally-verified framework for fair and abortable synchronization, enabling efficient implementation of various primitives with modular proofs and improved performance.
An Algebraic Language for Specifying Quantum Networks
Explore BellKAT, a novel specification language for quantum networks based on Kleene algebra, designed to address resource competition and enable formal reasoning about quantum network protocols.
LiDO: Linearizable Byzantine Distributed Objects with Refinement-Based Liveness Proofs
Explore LiDO, a consensus model enabling safety and liveness verification in Byzantine fault-tolerant protocols through refinement. Learn about mechanized proofs for Jolteon in Coq, advancing blockchain technology.