OpenAlex
PricingAboutJobs
Log inGet started
Work

Efficiently Sampling Probabilistic Programs via Program Analysis

HTML

Year: 2013
Type: conference-paper
Source: International Conference on Artificial Intelligence and Statistics
Authors: Arun Tejasvi Chaganty, Aditya V. Nori, Sriram K. Rajamani
Institutions: Stanford University, Microsoft (United States)
Language: English

Topic: Markov Chains and Monte Carlo Methods
Subfield: Statistics and Probability
Field: Mathematics
Domain: Physical Sciences
Keywords: probabilistic programs, sampling algorithms, symbolic execution, path exploration, loop programs, error bounds, backward propagation, weakest preconditions, rejection sampling, program analysis

Open Access status: closed
OpenAlex ID: W155204799
FWCI: 13.69
Cites: 15
Cited by: 61
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security