Joseph Tassarotti

A novel implementation of the Iris proof mode with improved performance, simplify the handling of equivalences through quotient types, build a variant of Diaframe proof automation, and provide convenience features like automatic construction of Iris fixed points are provided.

Elton can prove error bounds on security properties that were previously unaddressable, revolutionizing how we reason about adversarial probabilistic programs.

Alerus bridges the gap between formal verification and practical probabilistic programming in Rust, enabling the verification of complex sampling algorithms that were previously unmanageable.

Effect handlers not only simplify the development of program logics but also yield stronger reasoning rules than traditional methods, revolutionizing how we approach program effects.

Every linearizable data structure can now be paired with a logically atomic specification, simplifying the proof process in concurrent programming.

Parcas reveals that effective management of span credits can significantly enhance the verification of parallel program performance, challenging traditional approaches to time complexity.

LLMs can now certify bug reports with machine-checked proofs, drastically cutting down on false alarms in software development.

Finally, a program logic that handles the complexities of real-world differential privacy libraries, including privacy filters, higher-order functions, and interactive algorithms.