packages feed

lattest-lib-0.2: CHANGELOG.md

# Changelog for `lattest-lib`

All notable changes to this project will be documented in this file.

The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),
and this project adheres to the
[Haskell Package Versioning Policy](https://pvp.haskell.org/).

## Unreleased

## 0.2 - 2026-11-18
- Refactored the STS expression language, adding support for lists, sum and product types, several additional primitive types,
  operations on these types, and made the language more strongly typed.
  This slightly changes the interface, but STSs that were already correct should only need minimal changes.
- Added support for offline testing: Generating test sequences or trees without an adapter.
- Added support for test coverage: Reports on which gates and which input values have been checked, and controllers that either greedily pick uncovered gates, or steer towards them.
- Added the option to read and write some STS automata from and to JSON.
  This is currently aimed specifically for the integration between lattest and PICKLES,
  which is most noticable in the printing of guards and assertions (giving the ID of the corresponding guard/assertion in the input JSON).
  Please get in touch if you have other usecases!
- Added combinators to sequentially compose automata, in various flavours.
- Added symbolic look-ahead, which computes the combined guard of a trace through an STS.
- Where appropriate, we now generate pseudo-random input values for testing STS automata, rather than the first (and often simplest)
  solution that the SMT solver finds.
- Added support for MCDC conversion

## 0.1.1 - 2026-07-15
Bugfix patch: adds instance OrdTraversable FreeLattice, and properly kills the reading thread before its socket is closed.

## 0.1.0.0 - 2026-07-14
First release