Skip to Main content Skip to Navigation
Reports

Detecting interference through graph reduction

Abstract : Parallel programs which run in a shared-memory model have several threads that may interfere. There are constraints between the threads and these constraints can be modelled by a net. We present TLA nets, which are interesting for the representation of concurrent executions. A reduction operation is defined on these nets, in order to detect interferences. These interferences can be eliminated by adding components such as delays to the net. TLA nets are a graphical tool to explore the constraints of parallel programming.
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/hal-02435522
Contributor : Denis Roegel <>
Submitted on : Friday, January 10, 2020 - 8:11:15 PM
Last modification on : Wednesday, January 15, 2020 - 1:19:54 AM

File

roegel1997reducibility.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02435522, version 1

Collections

Citation

Denis Roegel. Detecting interference through graph reduction. [Research Report] Loria & Inria Grand Est. 1997. ⟨hal-02435522⟩

Share

Metrics

Record views

27

Files downloads

66