2013 13th International Conference on Application of Concurrency to System Design最新文献_第3页

LTL Model Checking of Parallel Programs with Under-Approximated TSO Memory Model 欠逼近TSO内存模型下并行程序的LTL模型检验

2013 13th International Conference on Application of Concurrency to System Design Pub Date : 2013-07-08 DOI: 10.1109/ACSD.2013.8

J. Barnat, L. Brim, Vojtech Havel

引用次数: 7

Precision Timed Embedded Systems Using TickPAD Memory 使用TickPAD内存的精确定时嵌入式系统

2013 13th International Conference on Application of Concurrency to System Design Pub Date : 2013-07-01 DOI: 10.1109/ACSD.2013.30

Matthew M. Y. Kuo, P. Roop, Sidharta Andalam, N. Patel

引用次数: 3

Bounded Model Checking of an MITL Fragment for Timed Automata 时间自动机MITL片段的有界模型检验

2013 13th International Conference on Application of Concurrency to System Design Pub Date : 2013-04-26 DOI: 10.1109/ACSD.2013.25

R. Kindermann, Tommi A. Junttila, I. Niemelä

引用次数: 12

Queue-Dispatch Asynchronous Systems 队列调度异步系统

2013 13th International Conference on Application of Concurrency to System Design Pub Date : 2012-01-23 DOI: 10.1109/ACSD.2013.18

G. Geeraerts, Alexander Heußner, Jean-François Raskin

{"title":"Queue-Dispatch Asynchronous Systems","authors":"G. Geeraerts, Alexander Heußner, Jean-François Raskin","doi":"10.1109/ACSD.2013.18","DOIUrl":"https://doi.org/10.1109/ACSD.2013.18","url":null,"abstract":"To make the development of efficient multi-core applications easier, libraries, such as Grand Central Dispatch (GCD), have been proposed. When using such a library, the programmer writes so-called blocks, which are chunks of codes, and dispatches them, using synchronous or asynchronous calls, to several types of waiting queues. A scheduler is then responsible for dispatching those blocks on the available cores. Blocks can synchronize via a global memory. In this paper, we propose Queue-Dispatch Asynchronous Systems as a mathematical model that faithfully formalizes the synchronization mechanisms and the behavior of the scheduler in those systems. We study in detail their relationships to classical formalisms such as pushdown systems, Petri nets, fifo systems, and counter systems. Our main technical contributions are precise worst-case complexity results for the Parikh coverability problem and the termination question for several subclasses of our model. We give an outlook on extending our model towards verifying input-parametrized fork- join behaviour with the help of abstractions, and conclude with a hands-on approach for verifying GCD programs in practice.","PeriodicalId":166715,"journal":{"name":"2013 13th International Conference on Application of Concurrency to System Design","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114961453","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10