
Explore Zar: a verified compiler for discrete probabilistic programs, transforming cpGCL to executable samplers. Learn about choice-fix trees, interaction trees, and sampling equidistribution theorem.

Explore a novel region type-system for ensuring garbage-collection safety in polymorphic programs, addressing soundness issues and enabling efficient memory management strategies.

Explore an algorithm for merging inductive relations, improving automatic generation performance and simplifying mechanized proofs in proof engineering tools like QuickChick for Coq.

Explore space-efficient implementation of gradual typing with mostly parametric polymorphism. Learn about λCmp and λSmp calculi, their properties, and the implications for type-preserving translations.

Explore ConSol, a Solidity extension enhancing smart contract reliability through behavioral contracts. Learn to express critical conditions, prevent attacks, and improve code robustness and readability.

Explore a scalable analytical cache model for affine programs, improving performance prediction efficiency and enabling faster optimization decisions in large-scale software development.

Explore techniques for testing specifications in Dafny, including automatic mutation testing and Spec-Testing Proofs, to enhance trust in formal verification processes.

Explore verified assembly code generation using Dafny and reinforcement learning, combining efficiency with automatic correctness verification for complex programming tasks.

Explore techniques for assessing configuration impact on code, including propagating complexity metrics and test coverage to configuration level, to mitigate outage risks and improve system reliability.

Explore a language-parametric DSL approach for refactoring, examining its potential to streamline code improvement across multiple programming languages.

Explore parametric subtyping for structural parametric polymorphism. Learn about a decidable fragment of structural subtyping that generalizes rigid subtyping, with a proven saturation-based decision procedure.

Explore VST-A, a foundationally sound annotation verifier combining automation with rich assertion language and formal soundness proofs for imperative program verification.

Explore quantum computing advancements and their impact on programming languages in this POPL'24 session preview with Oded Padon.

Explore cutting-edge research in machine and automata learning at POPL'24, featuring insights from Steven Holtzen on latest advancements and applications.

Explore cutting-edge research in program synthesis with Hila Peleg's preview of the Synthesis 2 session at POPL'24, highlighting recent advancements in the field.

Explore automated verification techniques and advancements in program analysis with expert Viktor Kunčak at POPL'24's session preview.

Explore abstract interpretation for automatic differentiation, analyzing its application in machine learning, scientific computing, and graphics.

Explore a novel choice-based learning paradigm combining algebraic effects, handlers, and loss continuations to enhance modularity in machine learning programming.

Explore evolving weak memory models for modern architectures, focusing on advancements and challenges in concurrent programming and hardware design.

Explore mind-boggling complexities of weak memory models in programming, delving into their intricacies and implications for software development.

Explore wait-free weak reference counting design techniques for efficient memory management in concurrent systems.