Lash The Liege Automata-based Symbolic Handler (LASH)
Download

Lash Ranking & Summary

Lash Tags

manipulate represent represent infinite set finite-state representation manipulate automata infinite set

Lash Description

The Liege Automata-based Symbolic Handler (LASH) LASH is a toolset for representing infinite sets and exploring infinite state spaces. It is based on finite-state representations, which relies on finite-state automata for representing and manipulating infinite sets of values over various data domains. Here are some key features of "Lash": C libraries providing functions and datatypes for performing the following tasks: · Constructing and manipulating some types of finite-state automata (on finite and infinite words). · Manipulating and representing infinite and finite sets of values. · Exploring the state-space of systems composed of a finite control and of unbounded integer variables over which linear operations are performed. Front-ends for: · Compiling program models expressed in the Simple-PROMELA and the Simple-IF languages, and exploring the state-space of these programs. · Solving problems expressed in Presburger arithmetic.

Lash Related Software