Approximate counting in SMT and value estimation for probabilistic programs

#SMT, or model counting for logical theories, is a well-known hard problem that generalizes such tasks as counting the number of satisfying assignments to a Boolean formula and computing the volume of a polytope. In the realm of satisfiability modulo theories (SMT) there is a growing need for model...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Acta informatica Ročník 54; číslo 8; s. 729 - 764
Hlavní autoři: Chistikov, Dmitry, Dimitrova, Rayna, Majumdar, Rupak
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2017
Springer Nature B.V
Témata:
Algorithms
Arithmetic
Boolean algebra
Computer programming
Computer Science
Computer Systems Organization and Communication Networks
Data Structures and Information Theory
Information flow
Information Systems and Communication Service
Integer programming
Logics and Meanings of Programs
Original Article
Polynomials
Software Engineering/Programming and Operating Systems
Solvers
Static code analysis
Theory of Computation
ISSN:0001-5903, 1432-0525
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:#SMT, or model counting for logical theories, is a well-known hard problem that generalizes such tasks as counting the number of satisfying assignments to a Boolean formula and computing the volume of a polytope. In the realm of satisfiability modulo theories (SMT) there is a growing need for model counting solvers, coming from several application domains (quantitative information flow, static analysis of probabilistic programs). In this paper, we show a reduction from an approximate version of #SMT  to SMT. We focus on the theories of integer arithmetic and linear real arithmetic. We propose model counting algorithms that provide approximate solutions with formal bounds on the approximation error. They run in polynomial time and make a polynomial number of queries to the SMT solver for the underlying theory, exploiting “for free” the sophisticated heuristics implemented within modern SMT solvers. We have implemented the algorithms and used them to solve the value problem for a model of loop-free probabilistic programs with nondeterminism.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0001-5903
1432-0525
DOI:10.1007/s00236-017-0297-2