Advertisement

Least solutions of equations over N

  • Helmut Seidl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 820)

Abstract

We consider the problem of computing the least solution X i , i=1,..., n, of a system of equations xi=fi, i=1,..., n, over N, i.e., the naturals (extended by ∞), where the right hand sides fi are expressions built up from constants and variables by operations taken from some set Ω. We present efficient algorithms for various subsets Ω of the operations minimum, maximum, addition and multiplication.

Keywords

Abstract Interpretation Tree Automaton Ascend Chain Condition Random Access Machine Complete Partial Order 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CM93]
    B. Courcelle, M. Mosbah: Monadic Second-Order Evaluations on Tree-Decomposable Graphs. Theor. Comp. Sci. 109 (1993), 49–82Google Scholar
  2. [CC77]
    P. Cousot, R. Cousot: Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. 4th Symp. on Principles of Programming Languages, 238–252, Los Angeles, California, 1977Google Scholar
  3. [CC92a]
    P. Cousot, R. Cousot: Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation. Tech. Report LIENS 92-16, Paris, 1992Google Scholar
  4. [CC92b]
    P. Cousot, R. Cousot: Abstract Interpretation and Application to Logic Programs. Tech. Report LIX/RR/92/08, Palaiseau, 1992Google Scholar
  5. [FT87]
    M.L. Fredman, R.E. Tarjan: Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms. JACM (34), 597–615, 1987Google Scholar
  6. [HKV91]
    A. Habel, H.-J. Kreowski, W. Vogler: Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement. Theor. Comp. Sci. 89 (1991), 33–62Google Scholar
  7. [HH91]
    C. Hankin, S. Hunt: Fixed Points and Frontiers: A New Perspective. J. of Functional Programming (1), 91–120, 1991Google Scholar
  8. [Ke81]
    K. Kennedy: A Survey of Data Flow Analysis Techniques. In: S.S. Muchnick, N.D. Jones (eds.): Program Flow Analysis. Theory and Applications. Prentice-Hall, 1981Google Scholar
  9. [MR90]
    T.J. Marlowe, B.G. Ryder: Properties of Data Flow Frameworks. Acta Informatica (28), 121–163, 1990Google Scholar
  10. [NN92a]
    F. Nielson, H.R. Nielson: Bounded Fixed Point Iteration. J. Logic Computat. (2), 441–464, 1992Google Scholar
  11. [NN92b]
    F. Nielson, H.R. Nielson: Finiteness Conditions for Fixed Point Iteration. Prog. of LISP and Functional Programming 1992, 96–108Google Scholar
  12. [PC87]
    S. Peyton-Jones, C. Clack: Finding Fixpoints in Abstract Interpretations. In: S. Abramsky, C. Hankin (Eds.): Abstract Interpretation of Declarative Languages, 246–265 Ellis Horwood Ltd. and John Wiley, 1987Google Scholar
  13. [Se92]
    H. Seidl: Tree Automata with Cost Functions. Proc. CAAP'92, LNCS 581, 279–299, 1992; long version to appear in TCS, special issue on CAAP'92Google Scholar
  14. [Se93]
    H. Seidl: Equality of Instances of Variables in FORK. Tech. Rep. 6/93, SFB 124–C1, Saarbrücken, 1993Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Helmut Seidl
    • 1
  1. 1.Fachbereich InformatikUniversität des SaarlandesSaarbrückenGermany

Personalised recommendations