The DOI matches its Crossref record; 55 of the 55 references it cites were found in a registry or an index.
Probabilistic programming
Open accessAbstract
Probabilistic programs are usual functional or imperative programs with two added constructs: (1) the ability to draw values at random from distributions, and (2) the ability to condition values of variables in a program via observations. Models from diverse application areas such as computer vision, coding theory, cryptographic protocols, biology and reliability analysis can be written as probabilistic programs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1988) · Cited by 16,582
Information theory, inference, and learning algorithms
(2004) · Choice Reviews Online · doi:10.5860/choice.41-5949 · Cited by 6,362
Cousot, P., & Cousot, R. (1977) · Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77 · doi:10.1145/512950.512973 · Cited by 6,279
(2009) · Cited by 6,153
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Puterman, M. L. (1994) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316887 · Cited by 6,024
Understanding the Metropolis-Hastings Algorithm
Chib, S., & Greenberg, E. (1995) · The American Statistician · doi:10.1080/00031305.1995.10476177 · Cited by 4,145
The No-U-turn sampler: adaptively setting path lengths in Hamiltonian Monte CarloPreprint
Homan, M. D., & Gelman, A. (2014) · arXiv (Cornell University) · Cited by 3,405
Introduction to Discrete Event Systems
Cassandras, C. G., & Lafortune, S. (2021) · Springer eBooks · doi:10.1007/978-3-030-72274-6 · Cited by 3,342
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data
Heckerman, D., Geiger, D., & Chickering, D. M. (1995) · Machine Learning · doi:10.1023/a:1022623210503 · Cited by 3,231
The program dependence graph and its use in optimization
Ferrante, J., Ottenstein, K. J., & Warren, J. D. (1987) · ACM Transactions on Programming Languages and Systems · doi:10.1145/24039.24041 · Cited by 2,755
Kopf, E. W., & Lotka, A. J. (1925) · Journal of the American Statistical Association · doi:10.2307/2965538 · Cited by 2,371
PRISM 4.0: Verification of Probabilistic Real-Time Systems
Kwiatkowska, M., Norman, G., & Parker, D. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22110-1_47 · Cited by 2,361
Fluctuations in the Abundance of a Species considered Mathematically1
VOLTERRA, V. (1926) · Nature · doi:10.1038/118558a0 · Cited by 2,054
Guarded commands, nondeterminacy and formal derivation of programs
Dijkstra, E. W. (1975) · Communications of the ACM · doi:10.1145/360933.360975 · Cited by 1,941
The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo
Hoffman, M. D., & Gelman, A. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1111.4246 · Cited by 1,713
Introduction to Discrete Event Systems
(2008) · Springer eBooks · doi:10.1007/978-0-387-68612-7 · Cited by 1,688
A logic for reasoning about time and reliability
Hansson, H., & Jonsson, B. (1994) · Formal Aspects of Computing · doi:10.1007/bf01211866 · Cited by 1,372
Fluctuations in the Abundance of a Species considered Mathematically
VOLTERRA, V. (1927) · Nature · doi:10.1038/119012b0 · Cited by 1,210
Neural Information Processing Systems (NIPS)
Shang, X., Zhu, Z., Leimkuhler, B., & Storkey, A. (2015) · Cited by 831
Automatic predicate abstraction of C programs
Ball, T., Majumdar, R., Millstein, T., & Rajamani, S. K. (2012) · ACM SIGPLAN Notices · doi:10.1145/2442776.2442783 · Cited by 694
Self-citationAutomatic verification of probabilistic concurrent finite state programs
Vardi, M. Y. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.12 · Cited by 680
A Language and Program for Complex Bayesian Modelling
Gilks, W. R., Thomas, A., & Spiegelhalter, D. J. (1994) · The Statistician · doi:10.2307/2348941 · Cited by 653
TrueSkill™: A Bayesian Skill Rating System
Herbrich, R., Minka, T., & Graepel, T. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0076 · Cited by 639
On the hardness of approximate reasoning
Roth, D. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(94)00092-1 · Cited by 611
Church: a language for generative models
Goodman, N., Mansinghka, V., Roy, D. M., Bonawitz, K., & Tenenbaum, J. B. (2012) · arXiv · doi:10.48550/arxiv.1206.3255 · Cited by 577
Semantics of probabilistic programs
Kozen, D. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90036-2 · Cited by 497
Automatic predicate abstraction of C programs
Ball, T., Majumdar, R., Millstein, T., & Rajamani, S. K. (2001) · Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation · doi:10.1145/378795.378846 · Cited by 442
Self-citationAlgorithms and Complexity: New Directions and Recent Results
Traub, J. F. (1976) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 427
Leino, K. R. M. (1998) · Programming Concepts and Methods PROCOMET ’98 · doi:10.1007/978-0-387-35358-6_1 · Cited by 393
BLOG: Probabilistic Models with Unknown Objects
Milch, B., Marthi, B., Russell, S., Sontag, D., Ong, D. L., & Kolobov, A. (2007) · Introduction to Statistical Relational Learning · doi:10.7551/mitpress/7432.003.0015 · Cited by 390
Advances in Cryptology – CRYPTO 2010
(2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7 · Cited by 370
Suciu, D. (2008) · ACM SIGACT News · doi:10.1145/1388240.1388260 · Cited by 307
Formal certification of code-based cryptographic proofs
Barthe, G., Grégoire, B., & Zanella Béguelin, S. (2009) · Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1480881.1480894 · Cited by 268
Algebraic Decision Diagrams and Their Applications
Bahar, R. I., Frohm, E. A., Gaona, C. M., Hachtel, G. D., Macii, E., Pardo, A., & Somenzi, F. (1997) · Formal Methods in System Design · doi:10.1023/a:1008699807402 · Cited by 267
Computer-Aided Security Proofs for the Working Cryptographer
Barthe, G., Grégoire, B., Heraud, S., & Béguelin, S. Z. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_5 · Cited by 256
Tuffy: scaling up statistical inference in Markov logic networks using an RDBMS
Niu, F., Ré, C., Doan, A., & Shavlik, J. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/1978665.1978669 · Cited by 251
International Joint Conference on Artificial Intelligence (IJCAI 2017)
Belle, V. (2017) · Cited by 219
The Sketching Approach to Program Synthesis
Solar-Lezama, A. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10672-9_3 · Cited by 165
Lightweight Implementations of Probabilistic Programming Languages Via Transformational Compilation
Wingate, D., Stuhlmüller, A., & Goodman, N. D. (2011) · International Conference on Artificial Intelligence and Statistics · Cited by 133
Sankaranarayanan, S., Chakarov, A., & Gulwani, S. (2013) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2491956.2462179 · Cited by 130
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
de Alfaro, L., Kwiatkowska, M., Norman, G., Parker, D., & Roberto Segala, C. (2000) · Lecture notes in computer science · doi:10.1007/3-540-46419-0_27 · Cited by 129
The Ins and Outs of the Probabilistic Model Checker MRMC
Katoen, J.-P., Zapree, I. S., Hahn, E. M., Hermanns, H., & Jansen, D. N. (2009) · International Conference on the Quantitative Evaluation of Systems (QEST) · doi:10.1109/qest.2009.11 · Cited by 89
Effective Bayesian Inference for Stochastic Programs
Koller, D., McAllester, D., & Pfeffer, A. (1997) · Cited by 88
Bayesian inference using data flow analysis
Claret, G., Rajamani, S. K., Nori, A. V., Gordon, A. D., & Borgström, J. (2013) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/2491411.2491423 · Cited by 70
Self-citationThe Alchemy System for Statistical Relational AI: User Manual
Kok, S., Singla, P., Richardson, M., Domingos, P., & Poon, M. S. H. (2007) · Cited by 68
Measure Transformer Semantics for Bayesian Machine Learning
Borgström, J., Gordon, A. D., Greenberg, M., Margetson, J., & Gael, J. V. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19718-5_5 · Cited by 64
Self-citationChaudhuri, S., & Solar-Lezama, A. (2010) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1806596.1806629 · Cited by 58
The Design and Implementation of IBAL: A General-Purpose Probabilistic Language
Pfeffer, A. (2007) · The MIT Press eBooks · doi:10.7551/mitpress/7432.003.0016 · Cited by 54
Gordon, A. D., Graepel, T., Rolland, N., Russo, C. V., Borgström, J., & Guiver, J. (2014) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/2535838.2535850 · Cited by 46
Self-citationEfficiently Sampling Probabilistic Programs via Program Analysis
Chaganty, A. T., Nori, A. V., & Rajamani, S. K. (2013) · International Conference on Artificial Intelligence and Statistics · Cited by 41
Self-citationA model-learner pattern for bayesian reasoning
Gordon, A. D., Aizatulin, M., Borgström, J., Claret, G., Graepel, T., Nori, A. V., Rajamani, S. K., & Russo, C. V. (2013) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/2429069.2429119 · Cited by 35
Self-citationDynamic enforcement of knowledge-based security policies using probabilistic abstract interpretation
Mardziel, P., Magill, S., Hicks, M., & Srivatsa, M. (2013) · Journal of Computer Security · doi:10.3233/jcs-130469 · Cited by 33
Nonstandard Interpretations of Probabilistic Programs for Efficient Inference
Wingate, D., Goodman, N. D., Stuhlmüller, A., & Siskind, J. M. (2011) · Cited by 26
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Gordon, A. D., Aizatulin, M., Borgström, J., Claret, G., Graepel, T., Nori, A. V., Rajamani, S. K., & Russo, C. V. (2013) · ACM eBooks · Cited by 14
Self-citationStatistical Relational Learning
Blockeel, H. (2013) · Intelligent systems reference library · doi:10.1007/978-3-642-36657-4_8 · Cited by 11
Cited by
The frontier of simulation-based inference
Cranmer, K., Brehmer, J., & Louppe, G. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1912789117 · Cited by 1,032
Kernel Mean Embedding of Distributions: A Review and Beyond
Muandet, K., Fukumizu, K., Sriperumbudur, B., & Schölkopf, B. (2017) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000060 · Cited by 409
A Storm is Coming: A Modern Probabilistic Model Checker
Dehnert, C., Junges, S., Katoen, J.-P., & Volk, M. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-63390-9_31 · Cited by 401
Steps Toward Robust Artificial Intelligence
Dietterich, T. G. (2017) · AI Magazine · doi:10.1609/aimag.v38i3.2756 · Cited by 139
Scenic: a language for scenario specification and data generation
Fremont, D. J., Kim, E., Dreossi, T., Ghosh, S., Yue, X., Sangiovanni-Vincentelli, A. L., & Seshia, S. A. (2023) · Machine Learning · doi:10.1007/s10994-021-06120-5 · Cited by 112
Metadata
- Authors
- Gordon, A. D., Henzinger, T. A., Nori, A. V., & Rajamani, S. K.
- Venue
- Future of Software Engineering Proceedings
- Publisher
- ACM
- Published
- 2014-05-31
- Pages
- 167-181
- OpenAlex
- W2295266283
- Cited by
- 357
- References
- 55
- FWCI
- 20.16
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.