Satisfiability modulo counting

DOI10.1145/2603088.2603097zbMath1401.68194OpenAlexW2049389441MaRDI QIDQ4635627

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)

Related Items (2)

Computing and estimating the volume of the solution space of SMT(LA) constraints ⋮ Approximate counting in SMT and value estimation for probabilistic programs

This page was built for publication: Satisfiability modulo counting