Approximate Counting in SMT and Value Estimation for Probabilistic Programs

DOI10.1007/978-3-662-46681-0_26zbMath1420.68194OpenAlexW1528660673MaRDI QIDQ5194954

Rayna Dimitrova, Rupak Majumdar, Dmitry Chistikov

Publication date: 17 September 2019

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://link.springer.com/article/10.1007%2Fs00236-017-0297-2

zbMATH Keywords

integer arithmetichash functionBoolean formulasatisfying assignmentprobabilistic program

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (5)

Computing and estimating the volume of the solution space of SMT(LA) constraints ⋮ Approximate counting in SMT and value estimation for probabilistic programs ⋮ Semiring programming: a semantic framework for generalized sum product problems ⋮ Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults ⋮ Identity-Based Hierarchical Key-Insulated Encryption Without Random Oracles

This page was built for publication: Approximate Counting in SMT and Value Estimation for Probabilistic Programs