Skip to main navigation Skip to search Skip to main content

Using parallel and distributed reachability in model checking

  • RIIR Laboratory
  • University Oranl
  • LAB-STICC

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In the life cycle of any software system, a crucial phase of formalization and validation by means of verification and/or testing leads to the identification of probable errors infiltrated during its design. Model checking is one of the formal verification techniques. This technique is very powerful, but limited by the state explosion problem that occurs when the model to be checked is too large, and cannot be verified for lack of memory space. In this article, we cite two solutions, parallel and distributed, which aim to reduce the state space explosion. A comparative study between these approaches is carried out on a counters model.

Original languageEnglish
Title of host publicationAmbient Communications and Computer Systems - RACCCS 2017
EditorsShailesh Tiwari, Munesh C. Trivedi, Gregorio Martinez Perez, Krishn K. Mishra
PublisherSpringer Verlag
Pages143-154
Number of pages12
ISBN (Print)9789811073854
DOIs
Publication statusPublished - 1 Jan 2018
EventInternational Conference on Recent Advancement in Computer, Communication and Computational Sciences, RACCCS 2016 - Ajmer, India
Duration: 2 Sept 2017 → 3 Sept 2017

Publication series

NameAdvances in Intelligent Systems and Computing
Volume696
ISSN (Print)2194-5357

Conference

ConferenceInternational Conference on Recent Advancement in Computer, Communication and Computational Sciences, RACCCS 2016
Country/TerritoryIndia
CityAjmer
Period2/09/17 → 3/09/17

Keywords

  • Distributed exploration
  • Formal verification
  • Model checking
  • Parallel exploration
  • State explosion problem

Fingerprint

Dive into the research topics of 'Using parallel and distributed reachability in model checking'. Together they form a unique fingerprint.

Cite this