RefinedRust: A Type System for High-Assurance Verification of Rust Programs
Explore RefinedRust, a novel type system for verifying both safe and unsafe Rust code. Learn about its implementation, evaluation, and potential impact on high-assurance software development.
Inductive Approach to Spacer - PLDI 2024
Explore an inductive approach to Spacer, unifying it with GPDR and addressing refutational completeness issues in constrained Horn clause satisfiability problem solving.
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.
A Type-Theoretic Account of Quantum Computation
Explore type-theoretic concepts for describing and proving properties of quantum computations, focusing on quantum circuits using Coq's dependent and polymorphic types.
Dependent Session Protocols in Separation Logic from First Principles - Functional Pearl
Explore dependent session protocols in concurrent separation logic, building from mutable references to channels. Simplify verification using basic mechanisms for one-shot protocols and extend to dependent session protocols.
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.
Etna: An Evaluation Platform for Property-Based Testing - Experience Report
Explore Etna, a platform for evaluating property-based testing techniques. Compare popular frameworks in Coq and Haskell to understand best practices and tradeoffs in functional programming.
Relational Solver for Java Generics Type System
Explore a relational solver for Java Generics Type System, enhancing understanding of advanced programming concepts and type theory.
Solving Queries for Boolean Fault Tree Logic via Quantified SAT
Explore fault tree analysis using Boolean Logic and Quantified SAT. Learn to identify system failure factors, analyze what-if scenarios, and check element independence in fault trees.
Is Peter Correct or Incorrect? - O'HearnFest Lecture
Explore Patrick Cousot's analysis of Peter O'Hearn's work in program verification and reasoning, examining correctness and potential inaccuracies in his theories.
Bi-abductive Adversarial Program Synthesis
Explore bi-abductive adversarial program synthesis techniques in this advanced computer science talk by Julien Vanegue.
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.
On the Need for Available, Functional, and Reusable Memory Models
Explore challenges in memory model research through personal failure stories, highlighting shortcomings and future expectations for the field.
Reasoning via Semantic Transformations
Explore semantic transformations in reasoning processes, examining their role and impact on logical analysis and problem-solving techniques.
Modular Denotational Semantics for Effects with Guarded Interaction Trees
Explore guarded interaction trees for representing higher-order computations with effects in Coq. Learn about modular reasoning and cross-language interactions in higher-order languages.
Implementation and Synthesis of Math Library Functions
Explore MegaLibm, a domain-specific language for implementing, testing, and tuning math library functions. Learn how it enhances safety, modularity, and tunability in mathematical software development.
Parameterized Algebraic Protocols
Explore parameterized algebraic protocols for defining protocol templates and session types, enhancing expressiveness and modularity while enabling efficient type checking in linear time.
Functorial Syntax for All - Representing and Reasoning About Binding Structures
Explore a Coq library for reasoning about variable binding in programming languages using functorial syntax, with insights from development and application across projects.
Unified Compositional Formal Methods: Exact Separation Logic and the Gillian Platform - Incorrectness'24
Explore unified compositional formal methods for program correctness and incorrectness reasoning, focusing on exact separation logic and the Gillian platform.
Hashing Modulo Context-Sensitive Alpha-Equivalence - PLDI 2024
Explore efficient hashing for lambda-terms with context-sensitive alpha-equivalence. Learn about improved algorithms for subterm comparison and structure sharing in mathematical knowledge graphs.