Satisfiability modulo counting

DOI10.1145/2603088.2603097MaRDI QIDQ4635627zbMATH OpenOpenAlexFDO

Authors Matt Fredrikson, Somesh Jha

Publication date 23 April 2018

Published in Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• A new privacy homomorphism and applications
• A theorem on sensitivity and applications in private computation
• A Theorem on Sensitivity and Applications in Private Computation
• Optimal private halfspace counting via discrepancy
• scientific article; zbMATH DE number 1941261
• scientific article; zbMATH DE number 4057442
• Approximate privacy: foundations and quantification
• Differential privacy on finite computers

Cited in

(5)

• A communication-privacy tradeoff for modular addition
• Computing and estimating the volume of the solution space of SMT(LA) constraints
• Approximate counting in SMT and value estimation for probabilistic programs
• Certifying private probabilistic mechanisms
• The complexity of verifying loop-free programs as differentially private

This page was built for publication: Satisfiability modulo counting

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