The Liège Automata-based Symbolic Handler (LASH)


[ What is it? | Where can I find it? | How can I use it? | References | Feedback ]

What is it?

LASH is a toolset for representing infinite sets and exploring infinite state spaces. It is based on finite-state representations, which rely on finite-state automata for representing and manipulating infinite sets of values over various data domains.

The current version of LASH is beta version 0.9 and consists of

The following features are under development and will soon become part of the toolset:

The LASH toolset is currently maintained by Bernard Boigelot, Louis Latour and Sébastien Jodogne.

Past or occasional contributors include Gérard Cécé, Jean-Marc François and Yves Bontemps.

Where can I find it?

The C sources of the LASH toolset are available free of charge for evaluation purposes and educational use. A copy of the most recent version can be downloaded here. After downloading, please consult the installation instructions. The toolset documentation can be found in the next section.

How can I use it?

Documentation and sample programs are available - or will be available soon - for the main components of the package:

References

The techniques and algorithms implemented in LASH are described in the following papers.

Feedback

Questions, suggestions and bug reports are welcome. Please send your feedback to Bernard Boigelot.

[ What is it? | Where can I find it? | How can I use it? | Feedback ]