Synchronised Shared Memory and Model Checking

Author:

Aguado Joaquín1,Duenas Alejandra2

Affiliation:

1. Otto-Friedrich-Universität Bamberg, Germany

2. ICN Business School, France

Abstract

In this paper, a formal generic framework for defining and reasoning about deterministic concurrency in synchronous systems is implemented in the Spin model checker. Concretely, the paper implements the clock-synchronised shared memory ( csm ) theory , which extends synchronous programming with more and higher level csm  data types. These csm  data types are equipped with a synchronisation policy prescribing how concurrent calls to objects methods must be organised. In a policy constructive system, all methods of every object can be scheduled in a policy-conformant manner without deadlocking. In our framework, synchronous policies get codified as Promela never-claims. In this form, the model checker can search for executions (interleavings) that satisfy the synchronous product of all the never-claims, namely policy-conformant schedules for all the csm  objects. The existence of such a policy-conformant schedules, verifies that the concurrent synchronous system is deterministic. The approach of this paper extends beyond a single semantics since it can handle the synchronous programming model as well as the various forms of the sequentially constructive model found in the literature.

Publisher

Association for Computing Machinery (ACM)

Subject

Hardware and Architecture,Software

Reference24 articles.

1. Constructive Semantics for Instantaneous Reactions;Aguado J.;Theoretical Computer Science,2011

2. J. Aguado , M. Mendler , M. Pouzet , P. Roop , and R. von Hanxleden . 2018 . Deterministic Concurrency: A Clock-Synchronised Shared Memory Approach . In Proc. of the 27th European Symposium on Programming (ESOP’18) , LNCS 10801. Springer, Thessaloniki, Greece, 86–113. J. Aguado, M. Mendler, M. Pouzet, P. Roop, and R. von Hanxleden. 2018. Deterministic Concurrency: A Clock-Synchronised Shared Memory Approach. In Proc. of the 27th European Symposium on Programming (ESOP’18), LNCS 10801. Springer, Thessaloniki, Greece, 86–113.

3. J. Aguado , M. Mendler , R. von Hanxleden , and I. Fuhrmann . 2014. Grounding Synchronous Deterministic Concurrency in Sequential Programming . In Proc. of the 23rd European Symposium on Programming (ESOP’14) , LNCS 8410. Springer, Grenoble, France, 229–248. J. Aguado, M. Mendler, R. von Hanxleden, and I. Fuhrmann. 2014. Grounding Synchronous Deterministic Concurrency in Sequential Programming. In Proc. of the 23rd European Symposium on Programming (ESOP’14), LNCS 8410. Springer, Grenoble, France, 229–248.

4. Denotational fixed-point semantics for constructive scheduling of synchronous concurrency;Aguado J.;Acta Informatica, Special Issue on Combining Compositionality and Concurrency,2015

5. A formal hierarchy of weak memory models

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3