Advertisement

The fixpoint-analysis machine

  • Bernhard Steffen
  • Andreas Claßen
  • Marion Klein
  • Jens Knoop
  • Tiziana Margaria
Session: Mobile Processes I
Part of the Lecture Notes in Computer Science book series (LNCS, volume 962)

Abstract

We present a fixpoint-analysis machine, for the efficient computation of homogeneous, hierarchical, and alternating fixpoints over regular, context-free/push-down and macro models. Applications of such fix-point computations include intra- and interprocedural data flow analysis, model checking for various temporal logics, and the verification of behavioural relations between distributed systems. The fixpoint-analysis machine identifies an adequate (parameterized) level for a uniform treatment of all those problems, which, despite its uniformity, outperforms the ‘standard iteration based’ special purpose tools usually by factors around 10, even if the additional compilation time is taken into account.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ande92]
    H. Andersen: “Model Checking and Boolean Graphs”, Proc. of ESOP '92, LNCS 582, Springer Verlag, 1992.Google Scholar
  2. [Brya86]
    R. Bryant: “Graph-Based Algorithm for Boolean Function Manipulation”, IEEE Trans. on Computers, Vol. C-35, No. 8, pp. 677–691, 1986.Google Scholar
  3. [BuSt92]
    O. Burkart, B. Steffen: “Model Checking for Context-Free Processes”, Proc. of CONCUR '92, Stony Brook (NJ), August 1992, LNCS 630, pp. 123–137, Springer Verlag.Google Scholar
  4. [BuSt94]
    O. Burkart, B. Steffen: “Pushdown Processes: Parallel Composition and Model Checking”, Proc. of CONCUR'94, Stockholm (Sweden), August 1994, LNCS 836, pp. 98–113, Springer Verlag.Google Scholar
  5. [ClKS92]
    R. Cleaveland, M. Klein, B. Steffen: “Faster Model Checking for the Modal Mu-Calculus”, Proc. of CAV '92, Montreal (Canada) LNCS 663, pp. 410–422, Springer V., 1992.Google Scholar
  6. [ClSt91]
    R. Cleaveland, B. Steffen: “A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus”, Proc. CAV '91, Aalborg (Denmark), July 1991, LNCS 575, pp.48–58, Springer V.Google Scholar
  7. [ClSt91b]
    R. Cleaveland, B. Steffen: “Computing Behavioural Relations, Logically”, Proc. ICALP'91, Segovia (Spain), Aug. 1991, LNCS 510, Springer V.Google Scholar
  8. [EmLe86]
    A. Emerson, C.-L. Lei: “Efficient Model Checking in Fragments of the Propositional Mu-Calculus”, Proc. of LICS'86, IEEE Computer Society Press, pp. 267–278, 1986.Google Scholar
  9. [GKLR94]
    Geser, A., J. Knoop, G. Lüttgen, O. Rüthing, B. Steffen: “Chaotic Fixed Point Iterations”, Tech. Rep. N. MIP-9403, University of Passau (Germany), 1994.Google Scholar
  10. [Hech77]
    M. Hecht: “Flow Analysis of Computer Programs”, Elsevier, North-Holland, 1977.Google Scholar
  11. [Hung94]
    H. Hungar: “Model Checking of Macro Processes”, Proc. of CAV'94, Palo Alto (CA), June 1994, LNCS 818, Springer V., pp.169–181.Google Scholar
  12. [Knoo93]
    J. Knoop: “Optimal Interprocedural Program Optimization: A new Framework and its Application”, PhD thesis, Dep. of Computer Science, Univ. of Kiel, Germany, 1993. To appear as LNCS monograph, Springer V.Google Scholar
  13. [KnRS92]
    J. Knoop, O. Rüthing, B. Steffen: “Lazy Code Motion”, Proc. PLDI Conference'92, San Francisco, CA, June 1992, ACM SIGPLAN Notices, Vol.27, pp. 224–234.Google Scholar
  14. [KnRS94]
    J. Knoop, O. Rüthing, B. Steffen: “A Tool Kit for Constructing Optimal Interprocedural Data Flow Analyses”, Fakultät für Mathematik und Informatik, Univ. Passau, Germany, MIP-Bericht Nr. 9413 (1994).Google Scholar
  15. [KnSt92a]
    J. Knoop, B. Steffen: “The Interprocedural Coincidence Theorem”, Proc. CC'92, Paderborn (Germany), LNCS N.641, pp. 125–140, Springer V., 1992.Google Scholar
  16. [KnSt93a]
    J. Knoop, B. Steffen: “Efficient and Optimal Bit-vector Data Flow Analyses: A Uniform Interprocedural Framework”, Inst. für Informatik und Praktische Mathematik, Universität Kiel (Germany), Bericht Nr. 9309 (1993).Google Scholar
  17. [Lars92]
    K.G. Larsen: “Efficient Local Correctness Checking”, Proc. of CAV'92, Montreal (CAN), LNCS N.663, pp. 410–422, Springer V.Google Scholar
  18. [MaCS95]
    T. Margaria, A. Claßen, B. Steffen: “Computer Aided Tool Synthesis in the META-Frame ”, 3. GI/ITG Workshop on “Anwendung formaler Methoden beim Entwurf von Hardwaresystemen”, Passau (Germany), March 1995, pp. 11–20, Shaker Verlag.Google Scholar
  19. [Miln89]
    R. Milner: “Communication and Concurrency”, Prentice Hall, 1989.Google Scholar
  20. [MuSc85]
    D. Muller, P. Schupp: “The Theory of Ends, Pushdown Automata, and Second-Order Logic”, TCS N. 37, pp. 51–75, 1985.CrossRefGoogle Scholar
  21. [SFCM94]
    B. Steffen, B. Freitag, A. Claßen, T. Margaria, U. Zukowski: “Intelligent Software Synthesis in the DaCapo Environment”, Proc. 6th Nordic Workshop on Programming Theory, Aarhus (Denmark), October 1994, BRICS Report N. 94/6, December 1994, pp.466–481.Google Scholar
  22. [StMC95]
    B. Steffen, T. Margaria, A. Claßen: “The META-Frame: An Environment for Flexible Tool Management”, Proc. TAPSOFT'95, Aarhus, Denmark, May 1995, LNCS N. 915.Google Scholar
  23. [Stef89]
    B. Steffen: “Characteristic Formulae”, Proc. of ICALP'89, Stresa (Italy), LNCS N. 372, Springer Verlag, 1989.Google Scholar
  24. [Stef91]
    B. Steffen: “Data Flow Analysis as Model Checking”, Proc. TACS'91, Sendai (Japan), LNCS N. 526, pp. 346–364, Springer V., 1991.Google Scholar
  25. [Stef93]
    B. Steffen: “Generating Data Flow Analysis Algorithms from Modal Specifications”, Science of Computer Programming N.21, 1993, pp.115–139.CrossRefGoogle Scholar
  26. [Stef94]
    B. Steffen: “Finite Model Checking and Beyond”, (invited talk) Proc. 6th Nordic Workshop on Programming Theory, Aarhus (Denmark), October 1994, BRICS Report N. 94/6, December 1994, pp. 2–17.Google Scholar
  27. [StIn94]
    B. Steffen, A. Ingólfsdóttir: “Characteristic Formulae for Finite State Processes”, Information and Computation, Vol. 110, No. 1, 1994.Google Scholar
  28. [Tars55]
    A. Tarski: “A Lattice-Theoretical Fixpoint Theorem and its Applications”, Pacific Journal of Mathematics, v. 5, 1955.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Bernhard Steffen
    • 1
  • Andreas Claßen
    • 1
  • Marion Klein
    • 1
  • Jens Knoop
    • 1
  • Tiziana Margaria
    • 1
  1. 1.Lehrstuhl für ProgrammiersystemeUniversität PassauPassauGermany

Personalised recommendations