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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of logical and algebraic methods in programming Ročník 143; s. 101033
Hlavní autori: Kojima, Misaki, Nishida, Naoki, Matsubara, Yutaka
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Inc 01.02.2025
Predmet:
Concurrency
Constrained rewriting
Imperative program
Program transformation
Program verification
Constrained rewriting
Imperative program
Concurrency
Program verification
Program transformation
ISSN:2352-2208
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 programs with a fixed number of processes. Then, we show how to encode some well-known operations for semaphores by rewrite rules, showing two transformations of concurrent programs with semaphores into LCTRSs. We adopt list-using and list-free approaches to the encoding of waiting queues for semaphores in LCTRSs. While the former straightforwardly uses lists, the latter uses a so-called take-a-number system in order to avoid using any recursive data structures for waiting queues. •We extend a transformation of sequential programs into LCTRSs to concurrent programs with semaphores.•We show list-using and list-free approaches to the encoding of waiting queues for semaphores.•The list-free approach uses a take-a-number system to avoid using any recursive data structures for waiting queues.
ISSN:2352-2208
DOI:10.1016/j.jlamp.2024.101033