On the equality of probabilistic terms

DOI10.1007/978-3-642-17511-4_4zbMATH Open1311.94068OpenAlexW1714637014MaRDI QIDQ3066090FDOQ3066090

Authors: Gilles Barthe, M. Daubignard, Bruce M. Kapron, Vincent Laporte, Yassine Lakhnech 

Publication date: 7 January 2011

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17511-4_4

Recommendations

• Probabilistic logic over equations and domain restrictions
• scientific article; zbMATH DE number 1487486
• Universal Equivalence and Majority of Probabilistic Programs over Finite Fields
• Universal equivalence and majority of probabilistic programs over finite fields
• Formal certification of code-based cryptographic proofs

Mathematics Subject Classification ID

Cryptography (94A60) Applications of universal algebra in computer science (08A70)

Cited In (6)

• Universal equivalence and majority of probabilistic programs over finite fields
• Automated proofs of block cipher modes of operation
• Title not available (Why is that?)
• Probabilistic logic over equations and domain restrictions
• ON THE PROBABILISTIC CONVENTION T
• Title not available (Why is that?)

This page was built for publication: On the equality of probabilistic terms

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