Universal equivalence and majority of probabilistic programs over finite fields

DOI10.1145/3373718.3394746MaRDI QIDQ5145628zbMATH OpenOpenAlexFDO

Authors Gilles Barthe, Charlie Jacomme, Steve Kremer

Publication date 21 January 2021

Published in Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-02961583/document

zbMATH Keywords

complexitydecidabilityfinite fieldsprobabilistic programsprogram equivalence

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Privacy of data (68P27) Specification and verification (program logics, model checking, etc.) (68Q60) Cryptography (94A60)

Recommendations

• Universal Equivalence and Majority of Probabilistic Programs over Finite Fields
• CONCUR 2005 – Concurrency Theory
• On the equality of probabilistic terms
• On the Complexity of the Equivalence Problem for Probabilistic Automata
• On the hardness of analyzing probabilistic programs

Cited in

(7)

• Computing zeta functions of large polynomial systems over finite fields
• On the equality of probabilistic terms
• Universal Equivalence and Majority of Probabilistic Programs over Finite Fields
• CONCUR 2005 – Concurrency Theory
• Does a Program Yield the Right Distribution?
• On the Skolem problem and the Skolem conjecture
• The complexity of verifying loop-free programs as differentially private

This page was built for publication: Universal equivalence and majority of probabilistic programs over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145628)