Transforming concurrent programs with semaphores into logically constrained term rewrite systems
In this paper, as a first step of modeling concurrent programs by logically constrained term rewrite systems (LCTRSs, for short), we show transformations of concurrent programs with semaphore-based exclusive control into LCTRSs. To this end, we show how to encode configurations of concurrent program...
Saved in:
Published in | Journal of logical and algebraic methods in programming Vol. 143; p. 101033 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier Inc
01.02.2025
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!