Bibliography

16

David Clark, Chris Hankin and Sebastian Hunt.
Information Flow for Algol-like languages.
In Journal of Computer Languages, Systems and Structures, 2002.

17

Alessandra Di Pierro and Herbert Wiklicky.
Probabilistic Concurrent Constraint Programming: Towards a Fully Abstract Model.
In Proceedings of MFCS'98, LNCS 1450, 2000. Springer Verlag.

18

Alessandra Di Pierro and Herbert Wiklicky.
Quantitative observables and averages in Probabilistic Concurrent Constraint Programming.
In New Trends in Constraints, LNCS 1865, 2000. Springer Verlag.

19

Antonio Brogi and Alessandra Di Pierro and Herbert Wiklicky.
Linear Embedding for a Quantitative Comparison of Language Expressiveness.
In Electronic Notes in Theoretical Computer Science, 59:3, 2002.

20

Alessandra Di Pierro, Chris Hankin, and Herbert Wiklicky.
Probabilistic confinement in a declarative framework.
In Electronic Notes in Theoretical Computer Science, 48, 2001.

21

Alessandra Di Pierro and Herbert Wiklicky.
Concurrent Constraint Programming: Towards Probabilistic Abstract Interpretation.
In Proceedings of PPDP'00, 2000. ACM .

22

Alessandra Di Pierro and Herbert Wiklicky.
Measuring the precision of abstract interpretations.
In Proceedings of LOPSTR'00, LNCS 2042, 2001. Springer Verlag.

23

Alessandra Di Pierro, Chris Hankin, and Herbert Wiklicky.
Approximate non-interference.
In Proceedings of CSFW'02, IEEE Computer Society Press, 2002.

24

Alessandra Di Pierro, Chris Hankin, and Herbert Wiklicky.
Analysing Approximative Confinement under Uniform Attacks.
In Proceedings of SAS'02 LNCS 2477, 2002. Springer Verlag.

25

Alessandra Di Pierro and Herbert Wiklicky.
Probabilistic Abstract Interpretation and Statistical Testing,
In Proceedings PAPM/PROBMIV'02 LNCS 2399, 2002. Springer Verlag.

26

Thom Frühwirth, Alessandra Di Pierro, and Herbert Wiklicky.
Probabilistic Constraint Handling Rules,
In Electronic Notes in Theoretical Computer Science, 76, 2002.

27

Alessandra Di Pierro, Chris Hankin, and Herbert Wiklicky.
Approximate non-interference.
In Journal of Computer Security, 2003.

28

Alessandra Di Pierro, Chris Hankin, and Herbert Wiklicky.
Measuring the Confinement of Concurrent Probabilistic Systems.
In Proceedings of WITS'03 Workshop on Issues in the Theory of Security, 2003.

29

Alessandra Di Pierro, Chris Hankin, and Herbert Wiklicky.
Quantitative Relations and Approximate Process Equivalences.
To appear in Proceedings of CONCUR'03, 2003. Springer Verlag

30

Flemming Nielson, Hanne Riis Nielson and Chris Hankin.
Principles of Program Analysis.
Springer Verlag, 1999.

31

J.-M. Andreoli, C. Hankin and D. Le M'etayer.
Coordination Programming: Mechanisms, Models and Semantics.
Imperial College Press, 1996.

32

F. Bause and P.S. Kritzinger.
Stochastic Petri Nets - An Introduction to the Theory, Vieweg Verlag, 2002.

33

M. Bernardo, L. Donatiello, and R. Gorreri,
A Formal Approach to the Intergration of Performance Aspects in the Modelling and Analysis of Concurrent Systems.
Information and Computation, 144, pages 83-154, 1998.

34

L. Cardelli and A.D. Gordon.
Mobile Ambients.
In Theoretical Computer Science, 240:(1), ages 177-213, 2000.

35

P. Cousot.
Méthodes itératives de construction et d'approximation de point fixes d'opérateurs monotone sur un treilis, analyse sémantique des programmes.
Thése de Doctoratés Science Mathématiques, University of Grenoble, France, 1978.

36

P. Cousot and R. Cousot.
Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixedpoints.
In Proceedings of POPL, pages 238-252, 1977. ACM.

37

P. Cousot and R. Cousot.
Systematic Design of Program Analysis Frameworks.
In Proceedings of POPL, pages 269-282, 1979. ACM.

38

D. Cox and H. R. Miller.
The Theory of Stochastic Processes.
Chapman and Hall. 1965.

39

R. De Nicola, G. Ferrari, and R. Pugliese.
KLAIM: A kernel language for agents interaction and mobility.
IEEE Transactions on Software Engineering, 24(5):315-330, 1998.

40

L. De Alfaro.
How to Specify and Verify the Long-Run Average Behavior of Probabilistic Systems.
In Proceedings of LICS pages 454-465, IEEE, 1998

41

D. Gelernter
Generative Communications in Linda
In ACM Transactions on Programming Languages and Systems, 7(1), pages 80-112, 1985.

42

J. Goguen and J. Meseguer.
Security Policies and Security Models.
In Proceedings of the IEEE Symposium on Security and Privacy, pages 11-20. IEEE Computer Society Press, 1982.

43

D. Gollmann.
Computer Security.
John Wiley & Sons, 1999.

44

M. Hecht.
Flow analysis of computer programs.
North-Holland, 1977.

45

J. Hillston.
A Compositional Approach to Performance Modelling.
Cambridge University Press, 1996.

46

M. Hofmann and S. Jost.
Static prediction of heap space usage for first-order functional programs.
In Proceedings of POPL'03, pages 185-197. ACM, 2003

47

M. Hennessy and J. Riely.
Resource Access Control in Systems of Mobile Agents.
Report 2/98, University of Sussex, 1998.

48

B.W. Lampson.
A Note on the Confinement Problem.
Communications of the ACM, 16(10), pages 613-615, 1973.

49

K. Rustan M. Leino and Rajeev Joshi.
A semantic approach to secure information flow.
SRC Technical Note 1997-032, Digital Systems Research Center, Palo Alto CA, 1997.

50

D. Monniaux.
An abstract Monte-Carlo method for the analysis of probabilistic programs (extended abstract).
In Proceedings of POPL, pages 93-101, 2001. ACM.

51

D. Monniaux.
Backwards abstract interpretation of probabilistic programs.
In Proceedings of ESOP '01, number 2028 in LNCS. Springer Verlag, 2001.

52

A. Mycroft.
Abstract Interpretation and Optimising Transformations for Applicative Programs.
Ph.D. Thesis, University of Edinburgh, 1981.

53

P. Naur.
Checking of Operand Types in Algol Compilers.
BIT, 5:151-163, 1965.

54

J.R. Norris
Markov Chains.
Cambridge University Press, 1997.

55

C. Priami.
Stochastic $pi$-calculus.
The Computer Journal, 38(6):578-589, 1995.

56

J.C. Reynolds.
Automatic Computation of Data Set Definitions.
In IFIP'68, pages 456-461, 1969.

57

J.C. Reynolds.
Separation Logic: A Logic for Shared Mutable Data Structures.
In Proceedings of LICS, pages 55-74, IEEE Computer Society, 2002.

58

A. Sabelfeld and A.C. Myers
Language-Based Information-Flow Security.
IEEE Journal on Selected Areas in Communications 21(1), pages 5-19, 2003.

59

A. Sabelfeld and D. Sands.
A per model of secure information flow in sequential programs.
In ESOP'99, number 1576 in Lecture Notes in Computer Science, pages 40-58, Berlin - New York, 1999. Springer Verlag.

60

A. Sabelfeld and D. Sands.
Probabilistic noninterference for multi-threaded programs.
In Proceedings of the 13th IEEE Computer Security Foundations Workshop, 2000.

61

P.A. Samuelson and W.D. Nordhaus
Economics. Sixteenth edition.
McGraw-Hill, 1998.

62

D. Sands
Calculi for Time Analysis of Functional Programs.
PhD Thesis, Imperial College London, 1990.

63

M. Sintzoff.
Calculating properties of programs by valuations on specific models.
In ACM Conference on Proving Assertions About Programs, volume 7(1) of ACM SIGPLAN Not., pages 203-207, January 1972.

64

H.C. Tijms,
Stochastic Models - An Algorithmic Approach.
John Wiley & Sons, 1994.

65

G. Smith and D. Volpano.
Secure information flow in a multi-threaded imperative language.
In Proceedings of POPL, pages 355-364, 1998. ACM.

66

D. Volpano and G. Smith.
Confinement properties for programming languages.
SIGACT News, 29(3):33-42, 1998.

67

J. van Leeuwen.
Handbook of Theoretical Computer Science.
Elsevier-MIT Press, 1990.

68

C. Zou, W. Gong and D. Towsley.
Code Red Worm propagation modeling and analysis.
In Conference on Computer and Communications Security, pages 138-147, 2002. ACM Press.