Causality and Semantic Separation
Anna Zhang, Qinglan Luo, London Bielicke, Eunice Jun, Adam Chlipala

TL;DR
This paper rigorously formalizes the concept of d-separation in causal graphs using a semantic approach inspired by security noninterference, providing a foundational understanding of its correctness independent of probabilistic assumptions.
Contribution
It introduces a semantic characterization of d-separation, mechanized in Rocq, linking graph conditions to noninterference-inspired semantics for causal inference.
Findings
d-separation coincides with a novel semantic definition
Provides a structural semantic foundation for d-separation
Justifies methods for falsifying experiment world-models
Abstract
The design of scientific experiments deserves its own variation of formal verification to catch cases where scientists made important mistakes, such as forgetting to take confounding variables into account. One of the most fundamental underpinnings of science is causality, or what it means for interventions in the world to cause other outcomes, as formalized by computer scientists like Judea Pearl. However, these ideas had not previously been made rigorous to the standards of the programming-languages community, where one expects a (syntactic) program analysis to be proved sound with respect to a natural semantics. In the domain of causality, as the relevant "program analysis," we focus on -separation, a classic condition on graphs that can be used to decide when the design of an experiment controls for sufficiently many confounding variables, even though the reason that this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
