Probabilistic verification of Boolean functions

DOI10.1007/BF00464357MaRDI QIDQ685120zbMATH OpenOpenAlexFDO

Authors Jawahar Jain, Jacob A. Abraham, Donald S. Fussell, James R. Bitner

Publication date 30 September 1993

Published in Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00464357

zbMATH Keywords

algebraic transformsBoolean functionshash codesinequivalent functionsorthogonal partitioningprobabilistic verification

Mathematics Subject Classification ID

Recommendations

• Probabilistic verification of proofs
• Probabilistic verification
• Verification of Probabilistic Programs
• The complexity of probabilistic verification
• Probabilistic verification and approximation
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Verified computation with probabilities
• Probabilistic verification of proofs in calculuses
• scientific article; zbMATH DE number 1500556
• VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC

Cites work

• A fast algorithm for finding dominators in a flowgraph
• Binary Decision Diagrams
• Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 3594626 (Why is no real title available?)
• scientific article; zbMATH DE number 3353170 (Why is no real title available?)
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
• Probabilistic Aspects of Boolean Switching Functions via a New Transform
• Probabilistic Treatment of General Combinational Networks

Cited in

(12)

• Computation of signal output probability for Boolean functions represented by OBDD
• Detectability verification of probabilistic Boolean networks
• Probabilistic verification and approximation
• Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
• Computing Boolean functions via quantum hashing
• scientific article; zbMATH DE number 5547835 (Why is no real title available?)
• Formal verification of logical descriptions with functional uncertainty based on logarithmic encoding of conditions
• scientific article; zbMATH DE number 139969 (Why is no real title available?)
• On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
• Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs
• scientific article; zbMATH DE number 2148626 (Why is no real title available?)
• Worst-case groundness analysis using positive Boolean functions

This page was built for publication: Probabilistic verification of Boolean functions

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