From: Stefan Zetzsche <stefanzetzsche@gmail.com>
**
** CALL FOR PARTICIPATION
**
** Dafny at POPL 2025
** 2nd Workshop on the Dafny Programming and Verification Language
** 19th of January 2025, Denver, Colorado, United States
**
** https://popl25.sigplan.org/home/dafny-2025
**
** ACCEPTED PAPERS
Dockyard: A Modular Framework for Verifying Liveness of Byzantine Fault
Tolerant Systems
Helping users to reduce Brittleness in their Dafny programs - a success
story
Laurel: Unblocking Automated Verification with Large Language Models
Lean on Dafny: Exploring Interactive Verification of Dafny Programs in
Lean
Performant, Readable and Interoperable Rust from Dafny
VerMCTS: Synthesizing Multi-Step Programs using a Verifier, a Large
Language Model, and Tree Search
Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny
** ORGANISATION
Program Committee Chairs:
Program Committee:
Steering Committee Chairs:
** CONTACT
All questions should be emailed to the program chair Stefan Zetzsche (
stefanze@amazon.com).
From: Stefan Zetzsche <stefanzetzsche@gmail.com>
**
** CALL FOR PARTICIPATION
**
** Dafny at POPL 2026
** 3rd Workshop on Auto-active Programming and Verification Languages
** January 11, 2026. Rennes, France
**
** https://popl26.sigplan.org/home/dafny-2026
**
There is an established group of verification-aware programming languages
that have native
support for specifications and proofs, and are equipped with an auto-active
static program verifier.
Examples of such languages are Dafny, SPARK, F*, Why3, Viper, Whiley.
Auto-active tools also
exist for other languages like C, Java or Rust. The workshop aims to be a
forum for all auto-active
program verifiers and their related techniques.
** KEYNOTE
Speaker: Karthikeyan Bhargavan (Inria/Cryspen)
Title: Software Verification meets Real-World Cryptography
Abstract: In recent years, several software verification frameworks have
been applied to analyze
the correctness and security of implementations of cryptographic algorithms
and protocols, with
some notable successes. I will describe what makes the analysis of
real-world cryptography
interesting and challenging for formal verification, using examples from
several research and
commercial projects I have participated in. We will discuss the limits of
what can be proved today,
what remains to be done, and what challenges I see on the horizon.
** ACCEPTED TALKS
MiniF2F-Dafny: LLM-Guided Mathematical Theorem Proving via Auto-Active
Verification
Specification-Guided Repair of Arithmetic Errors in Dafny Programs using
LLMs
Teaching Automata Theory and Formal Languages with Dafny
** ORGANISATION
Program Committee:
Program Committee Chairs:
Steering Committee Chairs:
** CONTACT
All questions about submission should be emailed to the program chairs
Yannick Moy
(yannick.moy@gmail.com) or Stefan Zetzsche (stefanzetzsche@gmail.com).
Last updated: Jan 11 2026 at 16:28 UTC