Approximate Counting in SMT and Value Estimation for Probabilistic Programs

DOI10.1007/978-3-662-46681-0_26MaRDI QIDQ5194954zbMATH OpenOpenAlexFDO

Authors 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

hash functioninteger arithmeticBoolean 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)

Recommendations

• Approximate counting in SMT and value estimation for probabilistic programs
• Approximation and contamination bounds for probabilistic programs
• Efficient analysis of probabilistic programs with an unbounded counter
• Approximate counting with \(m\) counters: a probabilistic analysis
• Application ofComputable Distributions to the Semantics of Probabilistic Programs
• Probabilistic  -calculus and Quantitative Program Analysis
• Distribution, approximation and probabilistic model checking
• Probabilistic verification and approximation
• CONCUR 2005 – Concurrency Theory

Cited in

(12)

• Semiring programming: a semantic framework for generalized sum product problems
• Volume Computation for Boolean Combination of Linear Arithmetic Constraints
• Computing scores of forwarding schemes in switched networks with probabilistic faults
• Estimating the volume of the solution space of SMT(LIA) constraints by a flat histogram method
• Identity-Based Hierarchical Key-Insulated Encryption Without Random Oracles
• Local search algorithm for solving \#SMT problem
• SMT sampling via model-guided approximation
• Computing and estimating the volume of the solution space of SMT(LA) constraints
• Entailment vs. verification for partial-assignment satisfiability and enumeration
• Model counting meets \(F_0\) estimation
• Approximate counting in SMT and value estimation for probabilistic programs
• Enhancing SMT-based weighted model integration by structure awareness

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

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