Equivalence of two parallel execution systems
The method for properties proof for parallel programs running multiple-instance interleaving with shared memory is investigated. Two systems for parallel execution of programs are considered and the justification of the mutual expressiveness of these two approaches are presented in this paper. The f...
Saved in:
| Date: | 2018 |
|---|---|
| Main Authors: | Panchenko, T.V., Fabunmi, S. |
| Format: | Article |
| Language: | Ukrainian |
| Published: |
PROBLEMS IN PROGRAMMING
2018
|
| Subjects: | |
| Online Access: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/270 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Problems in programming |
| Download file: | |
Institution
Problems in programmingSimilar Items
-
Correctness Property Proof for the Banking System for Money Transfer Payments
by: Ostapovska, Yu.A., et al.
Published: (2018) -
Peterson’s algorithm Total correctness proof in IPCL
by: Zhygallo, A.A.
Published: (2018) -
Models of concurrent program running in resource constrained environment
by: Rahozin, D.V.
Published: (2020) -
Development of integrated system of scientific periodicals based on the OJS
by: Kudim, K.A., et al.
Published: (2017) -
Automated generation of parallel programs for graphics processing units based on algorithm schemes
by: Doroshenko, А.Yu., et al.
Published: (2017)