Abstract
Lambda-Upsilon-Omega, ΛΥΩ, is a system designed to perform automatic analysis of well-defined classes of algorithms operating over “decomposable” data structures.
It consists of an ‘Algebraic Analyzer’ System that compiles algorithms specifications into generating functions of average costs, and an ‘Analytic Analyzer’ System that extracts asymptotic informations on coefficients of generating functions. The algebraic part relies on recent methodologies in combinatorial analysis based on systematic correspondences between structural type definitions and counting generating functions. The analytic part makes use of partly classical and partly new correspondences between singularities of analytic functions and the growth of their Taylor coefficients.
The current version ΛΥΩ0 of ΛΥΩ implements as basic data types, term trees as encountered in symbolic algebra systems. The analytic analyzer can treat large classes of functions with explicit expressions. In this way, ΛΥΩ0 can generate in the current stage about a dozen non-trivial average case analyses of algorithms like: formal differentiation, some algebraic simplification and matching algorithms. Its analytic analyzer can determine asymptotic expansions for large classes of generating functions arising in the analysis of algorithms.
The outline of a design for a full system is also discussed here. The long term goal is to include a fairly rich set of data structuring mechanisms including some general recursive type definitions, and have the analytic analyzer treat wide classes of functional equations as may be encountered in combinatorial analysis and the analysis of algorithms.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
6. Bibliography
N. G. de Bruijn [1981]. Asymptotic Methods in Analysis. Dover, New York, 1981.
L. Comtet [1974]. Advanced Combinatorics. Reidel, Dordrecht, 1974.
P. Flajolet [1985]. “Elements of a general theory of combinatorial structures”, in Proc. FCT Conf., Lecture Notes in Comp. Sc, Springer Verlag, 1985, 112–127.
Ph. Flajolet [1988]. “Mathematical Methods in the Analysis of Algorithms and Data Structures,” in Trends in Theoretical Computer Science, E Börger Editor, Computer Science Press, 1988.
P. Flajolet and A. M. Odlyzko [1987]. “Singularity Analysis of Generating Functions”, preprint, 1987.
P. Flajolet and J-M. Steyaert [1987]. “A Complexity Calculus for Recursive Tree Algorihms”, J. of Computer and System Sciences19, 1987, 301–331.
I. Goulden and D. Jackson [1983]. Combinatorial Enumerations. Wiley, New York, 1983.
D. H. Greene [1983]. “Labelled Formal Languages and Their Uses,” Stanford University, Technical Report STAN-CS-83-982, 1983.
B. Harris and L. Schoenfeld [1968]. “Asymptotic Expansions for the Coefficients of Analytic Functions”, Illinois J. Math.12, 1968, 264–277.
W. K. Hayman [1956]. “A Generalization of Stirling's Formula”, J. Reine und Angewandte Mathematik196, 1956, 67–95.
P. Henrici [1977]. Applied and Computational Complex Analysis. Three Volumes. Wiley, New York, 1977.
T. Hickey and J. Cohen [1988]. “Automatic Program Analysis”, J.A.C.M.35, 1988, 185–220
D. E. Knuth [1973a]. The Art of Computer Programming. Volume 1: Fundamental Algorithms. Addison-Wesley, Reading, MA, second edition 1973.
D. E. Knuth [1973b]. The Art of Computer Programming. Volume 3: Sorting and Searching. Addison-Wesley, Reading, MA, 1973.
A. Meir and J. W. Moon [1978]. “On the Altitude of Nodes in Random Trees,” Canadian Journal of Mathematics30, 1978, 997–1015.
G. Pólya [1937]. “Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen”, Acta Mathematica68, 1937, 145–254. Translated in: G. Pólya and R. C. Read, Combinatorial Enumeration of Groups, Graphs and Chemical Compounds, Springer, New-York, 1987.
V. N. Sachkov [1978]. Verojatnostnie Metody v Kombinatornom Analize, Nauka, Moscow, 1978.
R. Sedgewick [1983]. Algorithms. Addison-Wesley, Reading, 1983.
R. P. Stanley [1978]. “Generating Functions,” in Studies in Combinatorics, edited by G-C. Rota, M. A. A. Monographs, 1978.
R. P. Stanley [1986]. Enumerative Combinatorics, Wadsworth and Brooks/Cole, Monterey, 1986.
J-M. Steyaert [1984]. “Complexité et Structure des Algorithmes”, These de Doctorat ès-Sciences, Université Paris 7, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flajolet, P., Salvy, B., Zimmermann, P. (1989). Lambda-Upsilon-Omega: An assistant algorithms analyzer. In: Mora, T. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1988. Lecture Notes in Computer Science, vol 357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51083-4_60
Download citation
DOI: https://doi.org/10.1007/3-540-51083-4_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51083-3
Online ISBN: 978-3-540-46152-4
eBook Packages: Springer Book Archive