λ-calculus and Quantitative Program Analysis

Authors:
Chris Hankin;Herbert Wiklicky
Affiliations:
Department of Computing, Imperial College London, London, UK;Department of Computing, Imperial College London, London, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 6
Cited 0

Concurrent constraint programming: towards probabilistic abstract interpretation

Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
An abstract Monte-Carlo method for the analysis of probabilistic programs

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Stochastic lambda calculus and monads of probability distributions

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Probabilistic game semantics

ACM Transactions on Computational Logic (TOCL)
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Principles of Program Analysis

Principles of Program Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we show how the framework of probabilistic abstract interpretation can be applied to statically analyse a probabilistic @l-calculus. We start by reviewing the classical framework of abstract interpretation. We choose to use (first-order) strictness analysis as our running example. We present the definition of probabilistic abstract interpretation and use it to construct a probabilistic strictness analysis.