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.
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.
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.
A Haskell Auto-Parallelizer for Distributed Computing
Explore a Haskell auto-parallelizer for distributed computing, leveraging function purity to create scalable and performant applications on large clusters.
Nanopass Attribute Grammars - Managing Complexity in Compiler Design
Explore nanopass attribute grammars for managing compiler complexity, enabling type-safe language versioning and transformation composition in feature-rich language implementations.
Language Model Agents Enable Semi-Formal Programming - LIVE23
Explore semi-formal programming using language model agents to capture semantic information and execute informal program elements, enhancing malleable programming environments.
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.
Centering Humans in the Programming Languages Classroom: Building a Text for the Next Generation
Explore principles for designing inclusive programming language textbooks, focusing on human-centered approaches and interdisciplinary applications in computer science education.
Applying Large Scale Diffing to Declarative Configuration Code for Production Safety
Explore large-scale diffing for declarative configuration code to enhance production safety, addressing unintended consequences and testing challenges in config changes.
Exploratory Study on Multi-User Program Synthesis - A Multi-Wizard Approach
Explore multi-user program synthesis through a design experiment, investigating collaborative potential and effectiveness in software engineering and related domains.
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.
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.
Symbolic Execution with Separating Decision Diagrams
Explore symbolic execution techniques using Separating Decision Diagrams in this advanced computer science talk by Josh Berdine.
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.