NDLI: BMC via on-the-fly determinization

Content Provider	Springer Nature Link
Author	Jussila, Toni Heljanko, Keijo Niemelä, Ilkka
Copyright Year	2005
Abstract	This paper develops novel bounded model checking (BMC) techniques for asynchronous parallel systems. The aim is to increase the efficiency of BMC by exploiting the inherent concurrency in such systems. This added efficiency is gained by covering more reachable states within a given bound using two techniques. Firstly, a nonstandard execution model, step executions, where multiple actions can take place simultaneously is applied. Secondly, the number of executions the system can have is reduced by modeling the execution of the system components as if they were determinized. This determinization technique also enables the removal of the internal transitions of the components. Step executions can be further restricted to a subclass called process executions without losing any reachable states.The paper presents a translation scheme for BMC of reachability properties. The translation is from an asynchronous system where the components are modeled as labeled transition systems (LTSs) to a propositional formula. The models of the formula correspond to the step executions of the original system where each component is replaced with its determinized counterpart. The formula for step executions can be easily extended in such a way that its models correspond to the process executions of the system. The translation scheme has been implemented and some experimental comparisons performed. The results show that the bound needed to detect a violation of a reachability property is, for step and process executions, in most cases lower than in interleaving executions and that the running time of the model checker using process executions is smaller than of that using steps. Moreover, the performance compares favorably to a state-of-the-art interleaving BMC implementation in the NuSMV system.
Starting Page	89
Ending Page	101
Page Count	13
File Format	PDF
ISSN	14332779
Journal	International Journal on Software Tools for Technology Transfer
Volume Number	7
Issue Number	2
e-ISSN	14332787
Language	English
Publisher	Springer Berlin Heidelberg
Publisher Date	2005-01-25
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Verification Bounded model checking Labeled transition system Software Engineering Software Engineering/Programming and Operating Systems Theory of Computation
Content Type	Text
Resource Type	Article
Subject	Information Systems 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

Efficient distributed SAT and SAT-based distributed Bounded Model Checking

Applying symbolic bounded model checking to the 2012 RERS greybox challenge

Handling loops in bounded model checking of C programs via k-induction

Symbolic computational techniques for solving games

Constraint-based BMC: a backjumping strategy

Regular model checking

A BMC-based formulation for the scheduling problem of hardware systems

LTL generalized model checking revisited

Computational challenges in bounded model checking

BMC via on-the-fly determinization

Similar Documents

Efficient distributed SAT and SAT-based distributed Bounded Model Checking

Applying symbolic bounded model checking to the 2012 RERS greybox challenge

Handling loops in bounded model checking of C programs via k-induction

Symbolic computational techniques for solving games

Constraint-based BMC: a backjumping strategy

Regular model checking

A BMC-based formulation for the scheduling problem of hardware systems

LTL generalized model checking revisited

Computational challenges in bounded model checking

BMC via on-the-fly determinization