Charlie Jacomme
Charlie Jacomme
Home
Publications
Teaching
Non Academic Materials
Contact
Light
Dark
Automatic
2
Universal Equivalence and Majority of Probabilistic Programs over Finite Fields
We study decidability problems for equivalence of probabilistic programs for a core probabilistic programming language over finite fields of fixed characteristic. The programming language supports uniform sampling, addition, multiplication, and …
An extensive formal analysis of multi-factor authentication protocols
Cite
×