Weighted Refinement Types for Counterpoint Composition
Explore weighted refinement types for music composition, blending programming concepts with music theory to create flexible counterpoint systems.
Asynchronous Probabilistic Couplings in Higher-Order Separation Logic
Explore asynchronous probabilistic couplings in higher-order separation logic, addressing synchronization issues in relational program logics for enhanced reasoning about probabilistic programs.
Formal Analysis
Explore computer-aided cryptography, symbolic verification, and verifiable primitives in this comprehensive analysis of formal methods in cryptographic design and security.
Quantum Cloud Computing - Prof Elham Kashefi
Explore quantum technology's impact on cloud computing, covering verification, protocols, and secure multi-party computing with Prof Elham Kashefi.
Fairness and Robustness in Machine Learning – A Formal Methods Perspective - Aditya Nori, Microsoft
Explore fairness in machine learning through formal methods. Learn techniques for verifying probabilistic properties and certifying fairness in decision-making programs using FairSquare.
Towards Verified Deep Learning
Explore formal methods for verifying deep learning systems, focusing on robustness, semantic analysis, and applications in cyber-physical systems with UC Berkeley's Sanjit Seshia.
Reactive Synthesis
Explore reactive synthesis in computer science, covering automata, LTL, distributed systems, and bounded synthesis. Learn about decidability, complexity, and recent advancements in reasoning.
Proofing the Correctness of CURP Consensus Protocol Using TLA+
Explore the CURP consensus protocol's correctness verification using TLA+, delving into its concepts, actions, and implications for distributed systems.
Challenges in Analysing Virtualisation Stacks - Dr Michael Tautschnig
Explore challenges in analyzing virtualization stacks, including shared responsibility, open-source software analysis, and coping with large codebases. Learn about workflows, bug reporting, and formal methods.
PLSE Seminar Series - The Power of Symbolic Automata
Explores symbolic automata, their applications in program verification, and novel decision procedures for equivalence checking and minimization of these powerful automata operating over infinite alphabets.
Mastering Concurrent Algorithms with TLA+
Explore TLA+ for modeling and verifying concurrent algorithms. Learn to use TLC model checker and TLA proof system to design robust, reliable software systems.
Modularity in PVS
Explore modularity concepts in PVS theorem proving, enhancing code organization and reusability for complex formal verification projects.
System Introductions I - HOL - Lecture 1
Introduction to the HOL theorem prover, exploring its features and applications in formal mathematics and computer science verification.
Syntaxes for Binding and Their Semantics
Explore binding syntaxes and their semantics with Guillaume Allais, delving into advanced concepts in programming language theory and formal methods.
The Verification of a Distributed System - A Practitioner's Guide to Increasing Confidence in System Correctness
Explore techniques for verifying distributed systems, addressing challenges of partial failure and asynchrony to increase confidence in system correctness and reliability.
Towards Provably Performant Congestion Control
Explores framework for designing congestion control algorithms with provable performance across diverse network scenarios, synthesizing algorithms and uncovering fundamental impossibility results.
Attacks and New Formalizations of Cryptanalysis
Explore cutting-edge cryptanalysis techniques and novel attack methods in this FSE 2024 session, chaired by Anne Canteaut. Gain insights into the latest developments in cryptographic security.
FSE 2024 Rump Session
Explore cutting-edge research and innovative ideas in formal methods and software engineering at this dynamic rump session, featuring rapid-fire presentations and lively discussions.
Using Formal Methods to Eliminate Exploitable Bugs - YOW! 2015
Explore formal methods for creating bug-free software, including SeL4 microkernel and CompCert compiler. Learn about recent advancements and limitations in producing high-assurance software for vehicles.
Function Extraction: Mapping Programs into Mathematica Equations
Extract precise program functions by mapping C-like code to Mathematica equations, enabling correctness verification and solving for program behavior.
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.