Verus: Verifying Rust Programs Using Linear Ghost Types
Explore Verus, an SMT-based tool for formally verifying Rust programs. Learn how it leverages Rust's linear types and borrow checking to prove functional correctness in low-level, high-assurance systems.
Derivative Based Nonbacktracking Real-World Regex Matching with Backtracking Semantics
Explore a new derivative-based theory and algorithm for nonbacktracking regex matching, supporting anchors and counting while preserving backtracking semantics. Implemented in .NET7 with formal proof of correctness.
Iris-Wasm: Robust and Modular Verification of WebAssembly Programs
Explore robust and modular verification of WebAssembly programs using Iris-Wasm, a mechanized higher-order separation logic for specifying and verifying individual modules with strong isolation guarantees.
The Landscape of Formal Verification in APL - A Review with a Case Study in Quantum Computing
Explore formal verification in APL, focusing on its potential for building dependable software. Examine a case study in quantum computing and discuss future implications for software development.
Property-Based Testing: Climbing the Stairway to Verification - Lecture
Explore property-based testing's integration with formal verification for enhanced code correctness assurance, using Cogent's framework as a case study.
A Calculus of Inductive Linear Constructions
Explore a novel calculus combining linear and dependent types, addressing challenges in linear dependent types research and enabling efficient resource management in programming.
An Intrinsically-typed Probabilistic Programming Language in Coq - Extended Abstract
Explore formalization of intrinsically-typed probabilistic programming language in Coq, focusing on syntax, evaluation, and formal verification applications.
Semantic Encapsulation Using Linking Types
Explore semantic encapsulation with linking types to preserve language invariants when integrating foreign code, ensuring sound interoperability in multi-language systems.
Explicit Refinement Types - A Type Theory with Embedded Proofs
Explore λert, a type theory with explicit proof refinement types. Learn about its soundness, denotational semantics, and formalization in Lean 4.
Combinator-Based Fixpoint Algorithms for Big-Step Abstract Interpreters
Explore combinator-based fixpoint algorithms for big-step abstract interpreters. Learn to develop and ensure soundness of sophisticated fixpoint algorithms using reusable combinators for static analysis.
CLOVER: Closed-Loop Verifiable Code Generation - Dafny'24
Explore CLOVER, a paradigm for ensuring correctness in AI-generated code through consistency checking among code, docstrings, and formal annotations using verification tools and language models.
Modularizing CPU Semantics for Virtualization
Explore modularization of CPU semantics for efficient virtualization, focusing on simplifying VMM implementation and verification while addressing challenges in hardware-assisted virtualization.
Towards Modular Specification and Verification of Concurrent Hypervisor-based Isolation
Explore modular specification and verification of NOVA microhypervisor using concurrent separation logic. Discover challenges in formally verifying concurrent systems for enhanced virtualization and isolation.
Symbolic Execution with Separating Decision Diagrams
Explore symbolic execution techniques using Separating Decision Diagrams in this advanced computer science talk by Josh Berdine.
Massive Proofs for the Masses
Explore massive proofs and their applications in computer science with Byron Cook's insightful presentation on cutting-edge verification techniques.
The Last Yard: Foundational End-to-End Verification of High-Speed Cryptography
Explore foundational end-to-end verification of high-speed cryptography, connecting Hacspec, Jasmin, and SSProve tools using Coq. Demonstrates approach with AES implementation proof.
Memory Simulations, Security and Optimization in a Verified Compiler
Explore memory simulations, security features, and optimizations in verified compilers. Gain insights into pointer allocations, stack canaries, and tail recursion elimination in CompCert.
Lean Formalization of Extended Regular Expression Matching with Lookarounds
Explore a formalized matching algorithm for extended regular expressions using Lean 4, covering intersection, complement, and lookarounds in symbolic derivatives and locations.
seL4 and BEAM: Running Erlang Without an OS
Explore running BEAM without an OS, focusing on security and robustness for embedded applications. Learn about seL4 microkernel, formal verification, and BEAM-seL4 integration.
Using Dynamically Layered Definite Releases for Verifying the RefFS File System
Explore RefFS, a groundbreaking concurrent file system with proven liveness and safety. Learn about dynamically layered definite releases and the MoLi framework for verifying concurrent systems.
Anvil: Verifying Liveness of Cluster Management Controllers
Innovative framework for verifying liveness in cluster management controllers, ensuring continuous reconciliation to desired states despite failures and asynchrony in cloud environments.