NDLI: On the Verification of Concurrent, Asynchronous Programs with Waiting Queues

Content Provider	ACM Digital Library
Author	Geeraerts, Gilles Raskin, Jean-François Heußner, Alexander
Copyright Year	2015
Abstract	Recently, new libraries, such as Grand Central Dispatch (GCD), have been proposed to directly harness the power of multicore platforms and to make the development of concurrent software more accessible to software engineers. When using such a library, the programmer writes so-called $\textit{blocks},$ which are chunks of code, and dispatches them using $\textit{synchronous}$ or $\textit{asynchronous}$ calls to several types of waiting queues. A scheduler is then responsible for dispatching those blocks among the available cores. Blocks can synchronize via a global memory. In this article, we propose Queue-Dispatch Asynchronous Systems as a mathematical model that faithfully formalizes the synchronization mechanisms and 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 problem for several subclasses of our model. We also consider an extension of Qdas with a fork-join mechanism. Adding fork-join to any of the subclasses that we have identified leads to undecidability of the coverability problem. This motivates the study of over-approximations. Finally, we consider handmade abstractions as a practical way of verifying programs that cannot be faithfully modeled by decidable subclasses of Qdas.
Starting Page	1
Ending Page	26
Page Count	26
File Format	PDF
ISSN	15399087
e-ISSN	15583465
DOI	10.1145/2700072
Volume Number	14
Issue Number	3
Journal	ACM Transactions on Embedded Computing Systems (TECS)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2015-04-30
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Asynchronous programming Waiting queues
Content Type	Text
Resource Type	Article
Subject	Hardware and Architecture Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Algorithmic verification of asynchronous programs

Formal verification of concurrent programs using the Larch prover

Efficient Verification of Sequential and Concurrent C Programs

Exponential bounds for the waiting time distribution in Markovian queues, with applications to TES/GI/1 systems

Formal derivation of rule-based programs

Studying the performance properties of concurrent programs by simulation experiments on synthetic programs

Pattern-Based Verification for Multithreaded Programs

The price of anarchy in parallel queues revisited

Asynchronous analysis of parallel dynamic programming

On the Verification of Concurrent, Asynchronous Programs with Waiting Queues

Similar Documents

Algorithmic verification of asynchronous programs

Formal verification of concurrent programs using the Larch prover

Efficient Verification of Sequential and Concurrent C Programs

Exponential bounds for the waiting time distribution in Markovian queues, with applications to TES/GI/1 systems

Formal derivation of rule-based programs

Studying the performance properties of concurrent programs by simulation experiments on synthetic programs

Pattern-Based Verification for Multithreaded Programs

The price of anarchy in parallel queues revisited

Asynchronous analysis of parallel dynamic programming

On the Verification of Concurrent, Asynchronous Programs with Waiting Queues