%0 Conference Proceedings
%T Using Parallel and Distributed Reachability in Model Checking
%+ University of Oran
%+ Lab-STICC_ENSTAB_ CACS_MOCS
%A Allal, Lamia
%A Belalem, Ghalem
%A Dhaussy, Philippe
%A Teodorov, Ciprian
%< avec comité de lecture
%( Ambient Communications and Computer Systems
%B Recent Advancement in Computer, Communication and Computational Sciences (RACCCS-2017)
%C Ajmer, India
%I Springer
%3 Advances in Intelligent Systems and Computing
%V 696
%P 143-154
%8 2017-09-02
%D 2017
%R 10.1007/978-981-10-7386-1_12
%K Formal verification
%K Distributed exploration
%K Parallel exploration
%K Model checking
%K State explosion problem
%Z Computer Science [cs]
%Z Computer Science [cs]/Software Engineering [cs.SE]Conference papers
%X 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.
%G English
%L hal-01780556
%U https://hal-ensta-bretagne.archives-ouvertes.fr/hal-01780556
%~ UNIV-BREST
%~ INSTITUT-TELECOM
%~ ENSTA-BRETAGNE
%~ CNRS
%~ UNIV-UBS
%~ ENSTA-BRETAGNE-STIC
%~ ENIB
%~ LAB-STICC
%~ INSTITUTS-TELECOM