Handbook of theoretical computer science (vol. A)
A calculus of mobile processes, I
Information and Computation
Graph-theoretic methods in database theory
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Introduction to set constraint-based program analysis
Science of Computer Programming
Tractable constraints in finite semilattices
Science of Computer Programming
Principles of Program Analysis
Principles of Program Analysis
Control Flow Analysis for the pi-calculus
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Static Analysis for Secrecy and Non-interference in Networks of Processes
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Complexity of Nesting Analysis in Mobile Ambients
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
An Abstract Interpretation Framework for Analysing Mobile Ambients
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Relational Analysis of Correlation
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Behavioural typing for safe ambients
Computer Languages, Systems and Structures
Nesting analysis of mobile ambients
Computer Languages, Systems and Structures
| Hi-index | 0.00 |
It is well-known that context-independent control flow analysis can be performed in cubic time for functional and object-oriented languages. Yet recent applications of control flow analysis to calculi of computation (like the π-calculus and the ambient calculus) have reported considerably higher complexities. In this paper we introduce two general techniques, the use of Horn clauses with sharing and the use of tiling of Horn clauses, for reducing the worst-case complexity of analyses. Applying these techniques to the π-calculus and the ambient calculus we reduce the complexity from O(n5) to O(n3) in both cases.