Approximate counting in SMT and value estimation for probabilistic programs

Chistikov, D., Dimitrova, R. and Majumdar, R. (2015) Approximate counting in SMT and value estimation for probabilistic programs. In: Baier, C. and Tinelli, C., (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 21st International Conference, TACAS 2015. Tools and Algorithms for the Construction and Analysis of Systems, 11-18 Apr 2015, London, UK. Lecture Notes in Computer Science (9035). Springer , pp. 320-334. ISBN 9783662466803

Abstract

Metadata

Authors/Creators:
  • Chistikov, D.
  • Dimitrova, R.
  • Majumdar, R.
Copyright, Publisher and Additional Information: © 2015 Springer-Verlag. This is an author-produced version of a paper subsequently published in TACAS 2015. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: Hash Function; Boolean Formula; Probabilistic Program; Satisfying Assignment; Integer Arithmetic
Dates:
  • Published: 11 April 2015
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 04 Feb 2020 14:22
Last Modified: 05 Feb 2020 15:47
Status: Published
Publisher: Springer
Series Name: Lecture Notes in Computer Science
Refereed: Yes
Identification Number: https://doi.org/10.1007/978-3-662-46681-0_26

Share / Export

Statistics