(Enter summary)
Abstract: We present a method for approximating the semantics of probabilistic programs to the purpose of constructing semantics-based analyses of such programs. The method resembles the one based on Galois connection as developed in the Cousot framework for abstract interpretation. The main difference between our approach and the standard theory of abstract interpretation is the choice of linear space structures instead of order-theoretic ones as semantical (concrete and abstract) domains. We show that... (Update)
Context of citations to this paper: More
...a set of agents by applying program analysis techniques. In particular, we will use the Probabilistic Abstract Interpretation technique [10, 11], which we will brie y recall in Section 4.1, to de ne a suitable collecting semantics for our analysis. Example 4. In an imperative...
...3. 1 Probabilistic Con nement as Probabilistic Abstract Interpretation Probabilistic Abstract Interpretation has been introduced in [11, 12] as a probabilistic version of the classical abstract interpretation framework introduced by Cousot Cousot [4, 5] Due to lack of...
Cited by: More
Quantitative Relations and Approximate Process Equivalences - Di Pierro, Hankin, Wiklicky (2003)
(Correct)
Measuring the Confinement of Concurrent Probabilistic.. - Di Pierro, Hankin, Wiklicky (2003)
(Correct)
Analysing Approximate Confinement under Uniform Attacks - Di Pierro, Hankin, Wiklicky (2002)
(Correct)
Active bibliography (related documents): More All
0.7: Quantitative Observables and Averages in Probabilistic.. - Di Pierro, Wiklicky (1999)
(Correct)
0.6: A Markov Model for Probabilistic Concurrent Constraint.. - Di Pierro, Wiklicky (1998)
(Correct)
0.6: Randomised Algorithms and Probabilistic Constraint Programming - Di Pierro, Wiklicky
(Correct)
Similar documents based on text: More All
0.8: Approximate Non-Interference - Di Pierro, Hankin, Wiklicky (2002)
(Correct)
0.5: Linear Structures for Concurrency in Probabilistic.. - Di Pierro, Wiklicky (2001)
(Correct)
0.4: Approximate Probabilistic Confinement - Di Pierro, Hankin, Wiklicky
(Correct)
Related documents from co-citation: More All
5: Approximate noninterference
- Di Pierro, Hankin et al. - 2002
3: Measuring the precision of abstract interpretations (context) - Di Pierro, Wiklicky - 2001
3: Generalized Inverses of Linear Transformations (context) - Campbell, Meyer - 1991
BibTeX entry: (Update)
A. Di Pierro and H. Wiklicky. Concurrent Constraint Programming: Towards Probabilistic Abstract Interpretation. In M. Gabbrielli and F. Pfenning, editors, Proceedings of PPDP'00 { Principles and Practice of Declarative Programming, pages 127-138, Montreal, Canada, September 2000. ACM SIGPLAN, Association of Computing Machinery. http://citeseer.ist.psu.edu/dipierro00concurrent.html More
@inproceedings{ dipierro00concurrent,
author = "Alessandra Di Pierro and Herbert Wiklicky",
title = "Concurrent constraint programming: towards probabilistic abstract interpretation",
booktitle = "Principles and Practice of Declarative Programming",
pages = "127--138",
year = "2000",
url = "citeseer.ist.psu.edu/dipierro00concurrent.html" }
Citations (may not include all citations):
700
Self-Organization and Associative Memory (context) - Kohonen - 1989
466
Probability and Measure (context) - Billingsley - 1986
312
Systematic Design of Program Analysis Frameworks (context) - Cousot, Cousot - 1979
218
Abstract Interpretation and Applications to Logic Programs (context) - Cousot, Cousot - 1992
216
Semantics foundations of concurrent constraint programming
- Saraswat, Rinard et al. - 1991
193
Abstract Interpretation: A Unied Lattice Model for Static An.. (context) - Cousot, Cousot - 1977
138
Abstract Interpretation of Declarative Languages (context) - Abramsky, Hankin - 1987
94
Model checking for a probabilistic branching time logic with..
- Baier, Kwiatkowska - 1996
93
A probabilistic powerdomain of evaluations (context) - Jones, Plotkin - 1989
83
Probabilistic Non-Determinism (context) - Jones - 1993
75
Semantics and Abstract Interpretation (context) - Cousot, Cousot - 1992
75
Semantics for probabilistic programs (context) - Kozen - 1981
74
Generalized Inverse of Linear Transformations (context) - Campbell, Meyer - 1979
40
Semiring-based constraint satisfaction and optimization
- Bistarelli, Montanari et al. - 1997
39
Abstract Interpretations of Reactive Systems (context) - Dams, Gerth et al. - 1997
36
Probabilistic predicate transformers
- Morgan, McIver et al. - 1995
30
Compositional analysis for concurrent constraint programming
- Falaschi, Gabrielli et al. - 1993
27
Angelic non-determinism in concurrent constraint programming
- Jagadeesan, Saraswat et al. - 1991
24
CPO's of measures for nondeterminism (context) - Saheb-Djahromi - 1980
21
volume 6 of Sigma Series in Pure Mathematics (context) - Engelking - 1989
21
Making Abstract Interpretations Complete
- Giacobazzi, Ranzato et al. - 2000
17
Constructive design of a Hierarchy of Semantics of a Transit..
- Cousot - 1997
12
An operational semantics for Probabilistic Concurrent Constr..
- Di Pierro, Wiklicky - 1998
10
The troublesome probabilistic powerdomain
- Jung, Tix - 1998
7
volume 134 of Translation of Mathematical Monographs (context) - Prasolov, Theorems et al. - 1994
6
Approximating continuous markov processes
- Desharnais, Gupta et al. - 2000
4
Probabilistic Concurrent Constraint Programming: Towards a f..
- Di Pierro, Wiklicky - 1998
4
Abstracting soft constraint
- Bistarelli, Codognet et al. - 1999
3
The operator theory of the pseudo-inverse (context) - Beutler - 1965
3
Nondeterminism and Innite Computations in Constraint Program.. (context) - de Boer, Di Pierro et al. - 1995
2
Principles of Program Aanalysis (context) - Nielson, Nielson et al. - 1999
2
Quantitative observables and averages in Probabilistic Const.. (context) - Di Pierro, Wiklicky - 2000
2
Stochastic programs as concurrent constraint programs (context) - Gupta, Jagadeesan et al. - 1999
1
Innite Behaviour and Fairness in Concurrent Constraint Progr.. (context) - Kwiatkowska - 1992
1
the Precision of Abstract Interpretations (context) - Di Pierro, Wiklicky - 2000
Documents on the same site (http://www.di.unipi.it/~dipierro/papers1.html): More
Ergodic Average in Constraint Programming (Extended Abstract) - Di Pierro, Wiklicky (1999)
(Correct)
Randomised Algorithms and Constraint Logic Programming - Angelopoulos, Di Pierro.. (1998)
(Correct)
Probabilistic Concurrent Constraint Programming: Towards a.. - Di Pierro, al. (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC