Universal Equivalence and Majority of Probabilistic Programs over Finite Fields

DOI10.1145/3487063MaRDI QIDQ5056363zbMATH OpenFDO

Authors Gilles Barthe, Charlie Jacomme, Steve Kremer

Publication date 8 December 2022

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3487063

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 Complexity of the Equivalence Problem for Probabilistic Automata
• Equational axioms for probabilistic bisimilarity
• scientific article; zbMATH DE number 1487486
• Universal aspects of probabilistic automata
• A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
• Generalized probabilistic satisfiability
• Application ofComputable Distributions to the Semantics of Probabilistic Programs

Cited in

(4)

• On the equality of probabilistic terms
• Universal equivalence and majority of probabilistic programs over finite fields
• CONCUR 2005 – Concurrency Theory
• Completing the picture for the Skolem problem on order-4 linear recurrence sequences

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 Q5056363)