(Enter summary)
Abstract: . Control Flow Analysis is a static technique for predicting safe and computable
approximations to the set of values that the objects of a program may assume
during its execution. We present an analysis for the ß-calculus that shows how names
will be bound to actual channels at run time. The formulation of the analysis requires
no extensions to the ß-calculus, except for assigning "channels" to the occurrences
of names within restrictions, and assigning "binders" to the occurrences of names... (Update)
Context of citations to this paper: More
.... polyadic calculus and other process calculi, checking e.g. input output behaviour [13] absence of deadlocks [6] security properties [1, 4], allocation of permissions to names [14] and many others. Types are compositional and thus allow reuse of information obtained in the...
.... polyadic calculus and other process calculi, checking e.g. input outputbehaviour [15] absence of deadlocks [7] security properties [1, 4], allocation of permissions to names [16] and many others. Types are compositional and thus allow reuse of information obtained in the...
Cited by: More
Analysing Input/Output-Capabilities of Mobile Processes with a.. - König
(Correct)
Similar documents (at the sentence level):
17.2%: Static Analysis for the pi-calculus with Applications to Security - Bodei, al. (2001)
(Correct)
12.7%: Static Analysis of Processes for No Read-Up and No.. - Bodei, Degano, Nielson.. (1999)
(Correct)
Active bibliography (related documents): More All
0.2: Global/Local Subtyping and Capability Inference for a Distributed .. - Sewell (1998)
(Correct)
0.2: Secure Implementation of Channel Abstractions - Abadi, Fournet, Gonthier (1998)
(Correct)
0.2: The Game of the Name in Cryptographic Tables - Amadio, Prasad (1999)
(Correct)
Similar documents based on text: More All
0.9: Control Flow Analysis Can Find New Flaws Too - Bodei, Buchholtz, Degano..
(Correct)
0.6: Annotated Type Systems for Program Analysis - Solberg (1995)
(Correct)
0.6: Security Analysis using Flow Logics - Bodei, Degano, Nielson, Nielson (2000)
(Correct)
Related documents from co-citation: More All
3: Linearity and the pi-calculus
- Kobayashi, Pierce et al. - 1996
3: Typing and sub-typing for mobile processes
- Pierce, Sangiorgi - 1996
3: Typing confluence
- Nestmann, Steffen - 1997
BibTeX entry: (Update)
Chiara Bodei, Pierpaolo Degano, Flemming Nielson, and Hanne Riis Nielson. Control flow analysis for the pi-calculus. In Davide Sangiorgi and Robert de Simone, editors, CONCUR '98, pages 84--98. Springer-Verlag, 1998. LNCS 1466. http://citeseer.ist.psu.edu/bodei98control.html More
@inproceedings{ bodei98control,
author = "Chiara Bodei and Pierpaolo Degano and Flemming Nielson and Hanne Riis Nielson",
title = "Control Flow Analysis for the pi-calculus",
booktitle = "International Conference on Concurrency Theory",
pages = "84-98",
year = "1998",
url = "citeseer.ist.psu.edu/bodei98control.html" }
Citations (may not include all citations):
854
Information and Computation (context) - Milner, Parrow et al. - 1992
265
Secure computer systems: Unified exposition and multics inte.. (context) - Bell, Padula - 1976
158
Secrecy by typing in security protocols
- Abadi
152
A sound type system for secure flow analysis
- Volpano, Smith et al. - 1996
146
Typing and sub-typing for mobile processes
- Pierce, Sangiorgi - 1996
127
Control flow analysis in Scheme (context) - Shivers - 1988
116
A typed language for distributed mobile processes
- Riely, Hennessy - 1998
115
An asynchronous model of locality (context) - Amadio - 1997
107
Object-Oriented Type Systems (context) - Palsberg, Schwartzbach - 1994
72
Security policy and security models (context) - Goguen, Meseguer - 1982
43
The compositional security checker: A tool for the verificat..
- Focardi, Gorrieri
42
Modal logics for mobile processes
- Milner, Parrow et al. - 1993
39
Properties of data flow frameworks - a unified model (context) - Marlowe, Ryder - 1990
28
Coordinating mobile agents via blackboards and access rights (context) - De Nicola, Ferrari et al. - 1997
24
a la ML for the join calculus (context) - Fournet, Laneve et al. - 1997
13
Comparing two information flow security properties
- Focardi - 1996
8
Systematic realisation of control flow analysis for CML (context) - Gasser, Nielson et al. - 1997
6
local subtyping for a distributed ß-calculus (context) - Sewell - 1997
5
Proving trust in systems of second-order processes: Prelimin..
- Dam - 1997
2
Abstract interpretation of the ß-calculus (context) - Venet - 1997
Documents on the same site (http://strudel.di.unipi.it/p40/pubbl/pubbl.html): More
Uniform Closures: Order-Theoretically Reconstructing Logic.. - Giacobazzi, al. (1998)
(Correct)
Static Analysis of Processes for No Read-Up and No.. - Bodei, Degano, Nielson.. (1999)
(Correct)
Matching for the Lambda Calculus of Objects - Bono, Bugliesi (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