A calculus of mobile processes, I
Information and Computation
An approach to the formal verification of cryptographic protocols
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Inside Java 2 platform security architecture, API design, and implementation
Inside Java 2 platform security architecture, API design, and implementation
Shape analysis for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Principles of Program Analysis
Principles of Program Analysis
Secrecy by Typing inSecurity Protocols
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Control Flow Analysis for the pi-calculus
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Flow Logics for Constraint Based Analysis
CC '98 Proceedings of the 7th International Conference on Compiler Construction
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Proving Properties of Security Protocols by Induction
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Checking security policies through an enhanced control flow analysis
Journal of Computer Security - Special issue on WITS'03
Static validation of security protocols
Journal of Computer Security
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Control Flow Analysis for BioAmbients
Electronic Notes in Theoretical Computer Science (ENTCS)
A Static Analysis for Beta-Binders
Electronic Notes in Theoretical Computer Science (ENTCS)
A Formal Analysis of Complex Type Flaw Attacks on Security Protocols
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Flow-sensitive type systems and the ambient calculus
Higher-Order and Symbolic Computation
Approximating Probabilistic Behaviors of Biological Systems Using Abstract Interpretation
Electronic Notes in Theoretical Computer Science (ENTCS)
Computer Languages, Systems and Structures
A Control Flow Analysis for Beta-binders with and without static compartments
Theoretical Computer Science
Hybrid logical analyses of the ambient calculus
Information and Computation
From Flow Logic to static type systems for coordination languages
Science of Computer Programming
Hybrid logical analyses of the ambient calculus
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Iterative specialisation of horn clauses
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Program analysis and compilation, theory and practice
Abstract interpretation based verification of temporal properties for BioAmbients
Information and Computation
Automated analysis of infinite scenarios
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Flow Logic for Process Calculi
ACM Computing Surveys (CSUR)
A new occurrence counting analysis for bioambients
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Analyzing security protocols in hierarchical networks
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
An analysis for proving temporal properties of biological systems
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Model checking Is static analysis of modal logic
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
An analysis for proving probabilistic termination of biological systems
Theoretical Computer Science
Hi-index | 5.23 |
The ambient calculus is a calculus of computation that allows active processes to communicate and to move between sites. A site is said to be a protective firewall whenever it denies entry to all attackers not possessing the required passwords. We devise a computationally sound test for validating the protectiveness of a proposed firewall and show how to perform the test in polynomial time. The first step is the definition of a flow logic for analysing the flow of control in mobile ambients; it amounts to a syntax-directed specification of the acceptability of a control flow estimate. The second step is to define a hardest attacker and to determine whether or not there exists a control flow estimate that shows the inability of the hardest attacker to enter; if such an estimate exists, then none of the infinitely many attackers can enter unless they contain at least one of the passwords, and consequently the firewall cannot contain any trap doors.