Suivant: À propos de ce
Retour: Projet de thèse: Analyse
Précédent: Perspectives
- 1
-
C. Bodei, P. Degano, F. Nielson, and H. R. Nielson.
Static analysis of processes for no read-up and no write-down.
In Proc. FOSSACS'99, number 1578 in Lecture Notes in Computer
Science, pages 120-134. Springer-Verlag, 1999.
- 2
-
L. Cardelli and A. D. Gordon.
Mobile ambients.
In Foundations of Software Science and Computational
Structures, volume 1378 of Lecture Notes in Computer Science, pages
140-155. Springer, 1998.
- 3
-
Luca Cardelli, Giorgio Ghelli, and Andrew D. Gordon.
Secrecy and group creation.
In Catuscia Palamidessi, editor, CONCUR 2000: Concurrency
Theory (11th International Conference, University Park, PA, USA), volume
1877 of lncs, pages 365-379. sv, August 2000.
- 4
-
P. Cousot and R. Cousot.
Abstract interpretation: a unified lattice model for static analysis
of programs by construction or approximation of fixpoints.
In Conference Record of the Fourth ACM Symposium on Principles
of Programming Languages, pages 238-252, Los Angeles, California, U.S.A.,
1977.
- 5
-
P. Cousot and R. Cousot.
Abstract interpretation frameworks.
Journal of logic and computation, 2(4):511-547, August 1992.
- 6
-
J. Feret.
Confidentiality analysis of mobile systems.
In Seventh International Static Analysis Symposium (SAS'00),
number 1824 in LNCS, pages 135-154. Springer-Verlag, 2000.
- 7
-
J. Feret.
Occurrence counting analysis for the -calculus.
In Preliminary Proc. Int. Workshop on Geometry and Topology in
Concurrency Theory, GETCO'00, number NS-00-3 in BRICS Notes Series, pages
99-116. Springer-Verlag, 2000.
- 8
-
R. R. Hansen, J. G. Jensen, F. Nielson, and H. R. Nielson.
Abstract interpretation of mobile ambients.
In Proc. SAS'99, number 1694 in Lecture Notes in Computer
Science, pages 134-148. Springer-Verlag, 1999.
- 9
-
Matthew Hennessy and James Riely.
Resource access control in systems of mobile agents.
In U. Nestmann and B. Pierce, editors, 3rd International
Workshop on High-Level Concurrent Languages (HLCL'98), volume 16(3) of Electronic Notes in Theoretical Computer Science, Nice, September 1998.
Elsevier.
Available from http://www.elsevier.nl/locate/entcs. Full
version available as Sussex CSTR 98/02, 1998. Available from
http://www.cogs.susx.ac.uk/.
- 10
-
Naoki Kobayashi, Shin Saito, and Eijiro Sumii.
An implicitly-typed deadlock-free process calculus.
In Catuscia Palamidessi, editor, CONCUR 2000: Concurrency
Theory (11th International Conference, University Park, PA, USA), volume
1877 of lncs, pages 489-503. sv, August 2000.
- 11
-
R. Milner, J. Parrow, and D. Walker.
A calculus of mobile processes.
Information and Computation, 100:1-77, 1992.
- 12
-
H. Riis Nielson and F. Nielson.
Shape analysis for mobile ambients.
In Proc. POPL'00, pages 142-154. ACM Press, 2000.
- 13
-
A. Venet.
Automatic determination of communication topologies in mobile
systems.
In Proceedings of the Fifth International Static Analysis
Symposium SAS'98, volume 1503 of Lecture Notes in Computer Science,
pages 152-167. Springer-Verlag, 1998.
Jerome Feret
2000-11-02