Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2007.02261 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914867892453376 |
|---|---|
| author | Bortin, Maksym |
| author_facet | Bortin, Maksym |
| contents | The paper gives a detailed presentation of a framework, embedded into the simply typed higher-order logic and aimed at the support of sound and structured reasoning about various properties of models of imperative programs with interleaved computations. As a case study, a model of the Peterson's mutual exclusion algorithm will be scrutinised in the course of the paper illustrating applicability of the framework. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2007_02261 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | A Framework for Modelling, Verification and Transformation of Concurrent Imperative Programs Bortin, Maksym Logic in Computer Science The paper gives a detailed presentation of a framework, embedded into the simply typed higher-order logic and aimed at the support of sound and structured reasoning about various properties of models of imperative programs with interleaved computations. As a case study, a model of the Peterson's mutual exclusion algorithm will be scrutinised in the course of the paper illustrating applicability of the framework. |
| title | A Framework for Modelling, Verification and Transformation of Concurrent Imperative Programs |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2007.02261 |