An SAT-Based Method to Multithreaded Program Verification for Mobile Crowdsourcing Networks

Long Zhang,Yinjia Huo,Sikun Li,Wanxia Qu,Yang Guo

doi:10.1155/2018/3193974

Abstract

This paper focused on the safety verification of the multithreaded programs for mobile crowdsourcing networks. A novel algorithm was proposed to find a way to apply IC3, which is typically the fastest algorithm for SAT-based finite state model checking, in a very clever manner to solve the safety problem of multithreaded programs. By computing a series of overapproximation reachability, the safety properties can be verified by the SAT-based model checking algorithms. The results show that the new algorithm outperforms all the recently published works, especially on memory consumption (an advantage that comes from IC3).

Highlights

The mobile crowdsourcing network is a promising network architecture to perform tasks with human involvement and numerous mobile devices but suffers from security and privacy concerns [1, 2]
This paper focuses on the multithreaded programs for mobile crowdsourcing networks
A transition system (TTS) with standard thread and spawn transition can be expressed as plain Petri nets [22] and is the subset class of nicely sliceable well-structured transition system (NSW) [20]

Summary

Introduction

The mobile crowdsourcing network is a promising network architecture to perform tasks with human involvement and numerous mobile devices but suffers from security and privacy concerns [1, 2]. There have been several algorithms published for WSTS coverability problem [9,10,11, 20,21,22], but none perform as efficiently as finite state model checking. The IC3 algorithm [23] is an SAT-based model checking algorithm and introduced as an efficient technique for safety properties verification of finite state systems, especially in hardware verification. It computes an inductive invariant by maintaining a sequence of overapproximation of reachability from initial states and strengthens them incrementally.

Related Works

Nicely Sliceable WSTS

Multithreaded Programs Safety Verification

Experimental Evaluation

CEGAR 2

Conclusion and Future Works