On Algebraic Abstractions for Concurrent Separation Logics

no code implementations • 23 Oct 2020 • František Farka, Aleksandar Nanevski, Anindya Banerjee, Germán Andrés Delbianco, Ignacio Fábregas

This paper provides an algebraic formalization of ownership transfer in concurrent separation logic by means of structure-preserving partial functions (i. e., morphisms) between PCMs, and an associated notion of separating relations.

Programming Languages Logic in Computer Science

Verification of ML Systems via Reparameterization

no code implementations • 14 Jul 2020 • Jean-Baptiste Tristan, Joseph Tassarotti, Koundinya Vajjha, Michael L. Wick, Anindya Banerjee

Proof assistants can be used to formally verify machine learning systems by constructing machine checked proofs of correctness that rule out such bugs.

BIG-bench Machine Learning Fairness +1

A Formal Proof of PAC Learnability for Decision Stumps

no code implementations • 1 Nov 2019 • Joseph Tassarotti, Koundinya Vajjha, Anindya Banerjee, Jean-Baptiste Tristan

We present a formal proof in Lean of probably approximately correct (PAC) learnability of the concept class of decision stumps.

BIG-bench Machine Learning Learning Theory

Specifying Concurrent Programs in Separation Logic: Morphisms and Simulations

no code implementations • 15 Apr 2019 • Aleksandar Nanevski, Anindya Banerjee, Germán Andrés Delbianco, Ignacio Fábregas

In addition to pre- and postconditions, program specifications in recent separation logics for concurrency have employed an algebraic structure of resources---a form of state transition system---to describe the state-based program invariants that must be preserved, and to record the permissible atomic changes to program state.

Programming Languages Distributed, Parallel, and Cluster Computing Logic in Computer Science F.3.1; F.4.1; D.1.1; D.1.3; D.2.4; D.3.2