Undecidability of static analysis
ACM Letters on Programming Languages and Systems (LOPLAS)
On the complexity of flow-sensitive dataflow analyses
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Principles of Program Analysis
Principles of Program Analysis
Control-Flow Analysis in Cubic Time
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Safe Ambients: Control Flow Analysis and Security
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
Control Flow Analysis for the pi-calculus
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Validating Firewalls in Mobile Ambients
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
The Complexity of Model Checking Mobile Ambients
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
On the Complexity Analysis of Static Analyses
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Abstract Interpretation of Mobile Ambients
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Boundary Inference for Enforcing Security Policies in Mobile Ambients
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
The Decidability of Model Checking Mobile Ambients
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Control flow analysis of mobile ambients with security boundaries
FMOODS '02 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V
Abstract interpretation of mobile ambients
Science of Computer Programming - Special issue on static analysis (SAS'99)
Security boundaries in mobile ambients
Computer Languages, Systems and Structures
Behind BANANA: Design and Implementation of a Tool for Nesting Analysis of Mobile Ambients
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
A new algorithm is introduced for analyzing possible nesting in Mobile Ambient calculus. It improves both time and space complexities of the technique proposed by Nielson and Seidl. The improvements are achieved by enhancing the data structure representations, and by reducing the computation to the Control Flow Analysis constraints that are effectively necessary to get to the least solution.