В каталог

    Formal Verification

    181 курсов
    Verified Software Security Down to Gates
    Conference on Computer-Aided Verification

    Verified Software Security Down to Gates

    Haskell for Imperative Programmers
    Philipp Hagenlocher

    Haskell for Imperative Programmers

    Self-Proving Models: Learning Algorithms with Interactive Proof Systems
    Simons Institute for the Theory of Computing

    Self-Proving Models: Learning Algorithms with Interactive Proof Systems

    Provably Correct Smart Contracts Using DeepSEA
    Ethereum Engineering Group

    Provably Correct Smart Contracts Using DeepSEA

    Formal Verification of Distributed Validator Technology
    Ethereum Engineering Group

    Formal Verification of Distributed Validator Technology

    Decentralized Sequencers and QBFT: Understanding BFT Consensus Algorithms
    Ethereum Engineering Group

    Decentralized Sequencers and QBFT: Understanding BFT Consensus Algorithms

    Translating HOL-Light Proofs to Coq
    Hausdorff Center for Mathematics

    Translating HOL-Light Proofs to Coq

    Working with Mathlib - Lecture 1
    Centre International de Rencontres Mathématiques

    Working with Mathlib - Lecture 1

    Slow But Steady - Achieving Real Security Within Two Decades
    IEEE

    Slow But Steady - Achieving Real Security Within Two Decades

    Formal Modelling and Proof in the CHERI Design and Implementation Process
    IEEE

    Formal Modelling and Proof in the CHERI Design and Implementation Process

    Plug & Pray Today - Understanding USB Insecurity in Versions 1 through C
    IEEE

    Plug & Pray Today - Understanding USB Insecurity in Versions 1 through C

    Mitigating Attacks on Software Supply Chain Using GOSH Docker Extension
    Docker

    Mitigating Attacks on Software Supply Chain Using GOSH Docker Extension

    Pandora: Symbolic Validation of SGX
    Confidential Computing Consortium

    Pandora: Symbolic Validation of SGX

    Localized Attractor Computations for Infinite-State Games
    Simons Institute for the Theory of Computing

    Localized Attractor Computations for Infinite-State Games

    System Introductions I - PVS
    Hausdorff Center for Mathematics

    System Introductions I - PVS

    Solving Infinite-State Games via Acceleration
    ACM SIGPLAN

    Solving Infinite-State Games via Acceleration

    Timely Computation - A Formal Approach to Digital Circuit Design
    ACM SIGPLAN

    Timely Computation - A Formal Approach to Digital Circuit Design

    Quantitative Robustness for Vulnerability Assessment
    ACM SIGPLAN

    Quantitative Robustness for Vulnerability Assessment

    Safety-Critical Systems: Techniques for Ensuring Safety and Preventing Accidents
    Devoxx Poland

    Safety-Critical Systems: Techniques for Ensuring Safety and Preventing Accidents

    Deciding Asynchronous Hyperproperties for Recursive Programs
    ACM SIGPLAN

    Deciding Asynchronous Hyperproperties for Recursive Programs

    Beautiful Formalizations and Proofs in Mechanized Mathematics
    Hausdorff Center for Mathematics

    Beautiful Formalizations and Proofs in Mechanized Mathematics