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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H. Andersen: “Model Checking and Boolean Graphs”, Proc. of ESOP '92, LNCS 582, Springer Verlag, 1992.
R. Bryant: “Graph-Based Algorithm for Boolean Function Manipulation”, IEEE Trans. on Computers, Vol. C-35, No. 8, pp. 677–691, 1986.
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.
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.
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.
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.
R. Cleaveland, B. Steffen: “Computing Behavioural Relations, Logically”, Proc. ICALP'91, Segovia (Spain), Aug. 1991, LNCS 510, Springer V.
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.
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.
M. Hecht: “Flow Analysis of Computer Programs”, Elsevier, North-Holland, 1977.
H. Hungar: “Model Checking of Macro Processes”, Proc. of CAV'94, Palo Alto (CA), June 1994, LNCS 818, Springer V., pp.169–181.
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.
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.
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).
J. Knoop, B. Steffen: “The Interprocedural Coincidence Theorem”, Proc. CC'92, Paderborn (Germany), LNCS N.641, pp. 125–140, Springer V., 1992.
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).
K.G. Larsen: “Efficient Local Correctness Checking”, Proc. of CAV'92, Montreal (CAN), LNCS N.663, pp. 410–422, Springer V.
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.
R. Milner: “Communication and Concurrency”, Prentice Hall, 1989.
D. Muller, P. Schupp: “The Theory of Ends, Pushdown Automata, and Second-Order Logic”, TCS N. 37, pp. 51–75, 1985.
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.
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.
B. Steffen: “Characteristic Formulae”, Proc. of ICALP'89, Stresa (Italy), LNCS N. 372, Springer Verlag, 1989.
B. Steffen: “Data Flow Analysis as Model Checking”, Proc. TACS'91, Sendai (Japan), LNCS N. 526, pp. 346–364, Springer V., 1991.
B. Steffen: “Generating Data Flow Analysis Algorithms from Modal Specifications”, Science of Computer Programming N.21, 1993, pp.115–139.
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.
B. Steffen, A. Ingólfsdóttir: “Characteristic Formulae for Finite State Processes”, Information and Computation, Vol. 110, No. 1, 1994.
A. Tarski: “A Lattice-Theoretical Fixpoint Theorem and its Applications”, Pacific Journal of Mathematics, v. 5, 1955.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Steffen, B., Claßen, A., Klein, M., Knoop, J., Margaria, T. (1995). The fixpoint-analysis machine. In: Lee, I., Smolka, S.A. (eds) CONCUR '95: Concurrency Theory. CONCUR 1995. Lecture Notes in Computer Science, vol 962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60218-6_6
Download citation
DOI: https://doi.org/10.1007/3-540-60218-6_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60218-7
Online ISBN: 978-3-540-44738-2
eBook Packages: Springer Book Archive