# A separation logic for negative dependence

@article{Bao2022ASL, title={A separation logic for negative dependence}, author={Jialu Bao and Marco Gaboardi and Justin Hsu and Joseph Tassarotti}, journal={Proceedings of the ACM on Programming Languages}, year={2022}, volume={6}, pages={1 - 29} }

Formal reasoning about hashing-based probabilistic data structures often requires reasoning about random variables where when one variable gets larger (such as the number of elements hashed into one bucket), the others tend to be smaller (like the number of elements hashed into the other buckets). This is an example of negative dependence, a generalization of probabilistic independence that has recently found interesting applications in algorithm design and machine learning. Despite the…

## 2 Citations

Bunched Fuzz: Sensitivity for Vector Metrics

- Computer ScienceArXiv
- 2022

It is shown that products in Fuzz can be generalized to arbitrary L distances, metrics that are often used in privacy and optimization, and extended the Fuzz type system with bunches—as in the logic of bunched implications—where the distances of different groups of variables can be combined using different L distances.

Tight Bounds for Repeated Balls-into-Bins

- MathematicsArXiv
- 2022

We study the repeated balls-into-bins process introduced by Becchetti, Clementi, Natale, Pasquale and Posta [3]. This process starts with m balls arbitrarily distributed across n bins. At each step t…

## References

SHOWING 1-10 OF 41 REFERENCES

A probabilistic separation logic

- Computer Science, MathematicsProc. ACM Program. Lang.
- 2020

A new, probabilistic model of the logic of bunched implications (BI) is given, a program logic is built based on these assertions, and soundness of the proof system is proved.

A Bunched Logic for Conditional Independence

- Computer Science2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
- 2021

The logic of bunched implications is extended with a non-commutative conjunction and a model based on Markov kernels is provided; conditional independence can be directly captured as a logical formula in this model.

Quantitative separation logic: a logic for reasoning about probabilistic pointer programs

- Computer ScienceProc. ACM Program. Lang.
- 2019

The calculus preserves O’Hearn’s frame rule, which enables local reasoning, and it is demonstrated that the calculus enables reasoning about quantities such as the probability of terminating with an empty heap, the likelihood of reaching a certain array permutation, or the expected length of a list.

Certifying Certainty and Uncertainty in Approximate Membership Query Structures

- Computer ScienceCAV
- 2020

This work describes the framework for systematic decomposition of AMQs and their properties into a series of interfaces and reusable components and provides a library of domain-specific theorems and tactics that allow a high degree of automation in probabilistic proofs.

BI as an assertion language for mutable data structures

- PhilosophyPOPL '01
- 2001

A model in which the law of the excluded middleholds is given is given, thus showing that the approach is compatible with classical logic, and a local character enjoyed by specifications in the logic is described, which enables a class of frame axioms, which say what parts of the heap don't change, to be inferred automatically.

Intuitionistic reasoning about shared mutable data structure

- Computer Science
- 1999

This work extends Hoare's approach to proving the correctness of imperative programs, to deal with programs that perform destructive updates to data structures containing more than one pointer to the same location.

Probabilistic programming

- Computer ScienceFOSE
- 2014

This paper describes connections this research area called ``Probabilistic Programming" has with programming languages and software engineering, and this includes language design, and the static and dynamic analysis of programs.

Bunched logics: a uniform approach

- Computer Science
- 2019

This thesis investigates the family of bunched logics through two uniform frameworks, and extends duality theorems to the categorical structures suitable for interpreting predicate versions of the logics, in particular hyperdoctrinal structures used frequently in Separation Logic.

Possible worlds and resources: the semantics of BI

- Computer ScienceTheor. Comput. Sci.
- 2004

Fully-Dynamic Space-Efficient Dictionaries and Filters with Constant Number of Memory Accesses

- Computer ScienceArXiv
- 2019

This is the first space-efficient fully-dynamic dictionary that maintains both sets and random multisets and supports queries, insertions, and deletions with a constant number of memory accesses in the worst case with high probability.