A calculus of mobile processes, II
Information and Computation
The PEPA workbench: a tool to support a process algebra-based approach to performance modelling
Proceedings of the 7th international conference on Computer performance evaluation : modelling techniques and tools: modelling techniques and tools
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Quantifying the Dynamic Behavior of Process Algebras
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Extended Markovian Process Algebra
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Probabilistic Asynchronous pi-Calculus
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
A Fully Abstract Domain Model for the p-Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
An Operational Semantics for Probabilistic Concurrent Constraint Programming
ICCL '98 Proceedings of the 1998 International Conference on Computer Languages
IEEE Security and Privacy
SHReQ: Coordinating Application Level QoS
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Measuring the confinement of probabilistic systems
Theoretical Computer Science - Theoretical foundations of security analysis and design II
A Semiring-based Quantitative Analysis of Mobile Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A domain equation for bisimulation
Information and Computation
The φ-calculus: a language for distributed control of reconfigurable embedded systems
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
A Denotational Semantics for the π-Calculus
IW-FM'01 Proceedings of the 5th Irish conference on Formal Methods
Value-passing CCS with noisy channels
Theoretical Computer Science
| Hi-index | 0.00 |
This paper presents a syntax-directed non-uniform static analysis of the stochastic π-calculus to safely approximate the amount of time required before name substitutions occur in a process. Name substitutions form the basis for defining security properties, like information leakage. The presence of the quantitative and qualitative information in the results of the analysis allows us to reason about the speed at which sensitive information is leaked in a computing environment with malicious mobile code. We demonstrate the applicability of the analysis through a simple example of firewall breaches.