Abstract
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(n 5) to O(n 3) in both cases.
Chapter PDF
Similar content being viewed by others
Keyword
References
A. Aiken. Introduction to set constraint-based program analysis. Science of Computer Programming, 35:79–111, 1999.
C. Bodei, P. Degano, F. Nielson, and H. Riis Nielson. Static analysis for the π-calculus with applications to security. Information and Computation, (to appear), 2001.
C. Bodei, P. Degano, F. Nielson, and H. Riis Nielson. Control flow analysis for the π-calculus. In Proceedings of CONCUR’98, volume 1466 of LNCS, pages 84–98. Springer-Verlag, 1998.
L. Cardelli and A. D. Gordon. Mobile ambients. In Proceedings of FoSSaCS’98, volume 1378 of LNCS, pages 140–155. Springer-Verlag, 1998.
W. F. Dowling and J. H. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming, 3:267–284, 1984.
J. van Leeuwen. Graph Algorithms. Handbook of Theoretical Computer Science, A:525–631, 1990.
D. McAllester. On the complexity analysis of static analyses. In 6th Static Analysis Symposium (SAS), pages 312–329. LNCS 1694, Springer Verlag, 1999.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes (I and II). Information and Computation, 100(1):1–77, 1992.
F. Nielson, H. Riis Nielson, and C. L. Hankin. Principles of Program Analysis. Springer, 1999.
F. Nielson, H. Riis Nielson, R. R. Hansen, and J. G. Jensen. Validating firewalls in mobile ambients. In Proceedings of CONCUR’99, volume 1664 of LNCS, pages 463–477, 1999.
J. Rehof and T. Mogensen. Tractable constraints in finite semilattices. Science of Computer Programming (SCP), 35(1):191–221, 1999.
M. Yannakakis. Graph-theoretic concepts in database theory. In 9th ACM Symp. on Principles of Database Systems (PODS), pages 230–242, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nielson, F., Seidl, H. (2001). Control-Flow Analysis in Cubic Time. In: Sands, D. (eds) Programming Languages and Systems. ESOP 2001. Lecture Notes in Computer Science, vol 2028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45309-1_17
Download citation
DOI: https://doi.org/10.1007/3-540-45309-1_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41862-7
Online ISBN: 978-3-540-45309-3
eBook Packages: Springer Book Archive