# Generating Representative Executions [Extended Abstract]

## TL;DR

This paper introduces a generic framework leveraging Mazurkiewicz trace theory to efficiently generate canonical representative executions of concurrent programs, focusing on normal behaviors and discarding abnormal ones, particularly applied to relaxed memory models.

## Contribution

It presents a novel, flexible framework that specifies execution environments and generates Foata-normal executions, integrating dependency relations for behavior specification and abnormal execution filtering.

## Key findings

- Successfully generates all Foata-normal executions for specified environments.
- Framework effectively discards abnormal executions during generation.
- Applied framework to relaxed memory models of the SPARC hierarchy.

## Abstract

Analyzing the behaviour of a concurrent program is made difficult by the number of possible executions. This problem can be alleviated by applying the theory of Mazurkiewicz traces to focus only on the canonical representatives of the equivalence classes of the possible executions of the program. This paper presents a generic framework that allows to specify the possible behaviours of the execution environment, and generate all Foata-normal executions of a program, for that environment, by discarding abnormal executions during the generation phase. The key ingredient of Mazurkiewicz trace theory, the dependency relation, is used in the framework in two roles: first, as part of the specification of which executions are allowed at all, and then as part of the normality checking algorithm, which is used to discard the abnormal executions. The framework is instantiated to the relaxed memory models of the SPARC hierarchy.