Path Expressions Revisited

dc.contributor.author	Hövelmann, Thomas Alexander
dc.contributor.author	Krause, Alexander
dc.contributor.author	Ulbrich, Peter
dc.date.accessioned	2024-10-30T20:00:38Z
dc.date.available	2024-10-30T20:00:38Z
dc.date.issued	2024
dc.description.abstract	Path expressions provide a precise and concise method for defining synchronization rules for accessing shared data. In conjunction with predicates, even finer control of the sequences can be achieved. Furthermore, path expressions, with their ability to abstract from a specific synchronization technique, demonstrate a high level of adaptability. Despite being developed nearly five decades ago, they remain underrepresented in current software engineering and have yet to achieve widespread applicability. This paper reevaluates existing approaches and presents an automaton-based version of path expressions written in C++. We extend the concept of predicates to allow access to external system states and evaluate the feasibility and performance of our approach.	en
dc.identifier.doi	10.18420/fgbs2024h-01
dc.identifier.uri	https://dl.gi.de/handle/20.500.12116/45352
dc.language.iso	en
dc.pubPlace	Bonn
dc.publisher	Gesellschaft für Informatik e.V.
dc.relation.ispartof	Tagungsband des FG-BS Herbsttreffens 2024
dc.subject	Synchronization
dc.subject	Path Expressions
dc.subject	Parallelism
dc.subject	Predicates
dc.title	Path Expressions Revisited	en
dc.type	Text/Conference Paper
gi.document.quality	digidoc

Dateien

1 - 1 von 1