# Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer

@inproceedings{Flajolet1988LambdaU, title={Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer}, author={Philippe Flajolet and Bruno Salvy and Paul Zimmermann}, booktitle={AAECC}, year={1988} }

Lambda-Upsilon-Omega, ΛΥΩ, is a system designed to perform automatic analysis of well-defined classes of algorithms operating over “decomposable” data structures.

## 33 Citations

### The automatic complexity analysis of divide-and-conquer algorithms

- Computer Science
- 1989

A method of automatic complexity analysis to deal with divide-and-conquer algorithms with "intelligent" divide function that are not based on structural induction, but on noetherian induction is presented.

### Automatic Accurate Stack Space and Heap Space Analysisfor High-Level

- Computer Science
- 2000

This paper describes a general approach for automatic and accurate space and space-bound analyses for high-level languages, considering stack space, heap allocation and live heap space usage of…

### Automatic Accurate Time-Bound Analysis for High-Level Languages

- Computer ScienceLCTES
- 1998

The approach consists of transformations for building time-bound functions in the presence of partially known input structures, symbolic evaluation of the time- bound function based on input parameters, optimizations to make the overall analysis efficient as well as accurate, and measurements of primitive parameters, all at the source-language level.

### Automatic Accurate Stack Space and Heap Space Analysis for High-Level Languages

- Computer Science
- 2000

This paper describes a general approach for automatic and accurate space and space-bound analyses for high-level languages, considering stack space, heap allocation and live heap space usage of…

### Static prediction of heap space usage for first-order functional programs

- Computer SciencePOPL '03
- 2003

It is shown how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs and that integral solutions to the linear programs derived correspond to programs that can be evaluated without any operating system support for memory management.

### Automatic time-bound analysis for a higher-order language

- Computer SciencePEPM '02
- 2002

A general approach for automatic and accurate time-bound analysis for a functional high-level language, that combines methods and techniques studied in theory, languages, and systems, and the prototype system, ALPA, is described.

### Verified Analysis of Random Trees

- Computer Science
- 2018

This work is a case study of the formal verification and complexity analysis of some famous probabilistic algorithms and data structures in the proof assistant Isabelle/HOL: the expected number of…

### Complexity Analysis of a Functional Language

- 2014

This thesis describes a framework for the formally verified runtime complexity analysis of functional programs with the help of Isabelle/HOL. A simple, deeply embedded ML-style programming language…

### Type Systems for Resource-Bounded Programming and Compilation Case for Support

- Computer Science
- 2000

The ultimate aim of the work is to enhance new and existing programming languages with the authors' type systems, and to integrate them with production-quality compilers.

## References

SHOWING 1-10 OF 20 REFERENCES

### MATHEFATICAL METHODS IN THE ANALYSIS OF ALGORITHMS AND DATA STRUCTURES

- Mathematics, Computer Science
- 1985

The approach presented here is called the symbolirr' operator method: a large set 01 combinatorial c onstructions have direct translations c.s operators on counting generating functims, so that junctional equations over generating functions can be obtained rather directly for many combinatorially structures o j interest.

### Combinatorial Enumeration Of Groups, Graphs, And Chemical Compounds

- Mathematics
- 1987

1 Groups.- 2 Graphs.- 3 Chemical Compounds.- 4 Asymptotic Evaluation of the Number of Combinations.- The Legacy of Polya's Paper: Fifty Years of Polya Theory.- References.

### A Generalisation of Stirling's Formula.

- Mathematics
- 1956

n\ ru l — j |/2jm, äs n -> + oo, \ e l may be regarded äs an asymptotic formula for the coefficients of the exponential function. The present paper arises out the attempt to find a corresponding…

### Elements of a general theory of combinatorial structures

- MathematicsFCT
- 1985

This paper presents some preliminary observations relating in many cases structural definitions of combinatorial structures to statistical properties of their characteristic parameters.

### Asymptotic expansions for the coefficients of analytic functions

- Mathematics
- 1968

Abstract : Under suitable hypotheses concerning the analytic function f(z) = Sum from n=o to infinity of (alpha sub n)z to the nth power, it is shown that alpha sub n has an asymptotic expansion for…

### Singularity Analysis of Generating Functions

- MathematicsSIAM J. Discret. Math.
- 1990

This work presents a class of methods by which one can translate, on a term-by-term basis, an asymptotic expansion of a function around a dominant singularity into a corresponding asymptotic…

### The Art of Computer Programming

- Engineering, Physics
- 1968

The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.

### On the Altitude of Nodes in Random Trees

- MathematicsCanadian Journal of Mathematics
- 1978

Let Tn denote a tree with n nodes that is rooted at node r. (For definitions not given here see [4] or [10].) The altitude of a node u in Tn is the distance α = α (u, Tn) between r and u in Tn. The…

### Labelled formal languages and their uses

- Computer Science
- 1983

This research augments formal languages with the machinery to describe labelled combinatorial objects such as trees, permutations, and networks, and shows the value of labelled formal languages as a descriptive and analytic tool.