Probabilistic Analysis Based On Symbolic Game Semantics and Model Counting
Aleksandar S. Dimovski (IT University of Copenhagen)

TL;DR
This paper introduces a novel probabilistic analysis method for open programs using symbolic game semantics and model counting, enabling quantification of the likelihood of program properties with concrete probabilistic measures.
Contribution
It presents a new approach combining symbolic game semantics with model counting for probabilistic analysis of open programs, addressing a gap in existing techniques.
Findings
Successfully applied to several example programs
Provides probabilistic measures for property satisfaction
Enhances understanding of program reliability and security
Abstract
Probabilistic program analysis aims to quantify the probability that a given program satisfies a required property. It has many potential applications, from program understanding and debugging to computing program reliability, compiler optimizations and quantitative information flow analysis for security. In these situations, it is usually more relevant to quantify the probability of satisfying/violating a given property than to just assess the possibility of such events to occur. In this work, we introduce an approach for probabilistic analysis of open programs (i.e. programs with undefined identifiers) based on game semantics and model counting. We use a symbolic representation of algorithmic game semantics to collect the symbolic constraints on the input data (context) that lead to the occurrence of the target events (e.g. satisfaction/violation of a given property). The…
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.
