Date of Original Version

7-2012

Type

Conference Proceeding

Abstract or Description

Concurrent traces are sequences of computational steps where independent steps can be permuted and executed in any order. We study the problem of matching on concurrent traces. We outline a sound and complete algorithm for matching traces with one variable standing for an unknown subtrace.

Share

COinS
 

Published In

Proceedings of the International Workshop on Unification (UNIF), 2012, 14-19.