Model checking software requirement specifications using domain reduction abstraction

Yunja Choi, Mats Heimdahl

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations

Abstract

As an automated verification and validation tool, model checking can be quite effective in practice. Nevertheless, model checking has been quite inefficient when dealing with systems with data variables over a large (or infinite) domain, which is a serious limiting factor for its applicability in practice. To address this issue, we have investigated a static abstraction technique, domain reduction abstraction, based on data equivalence and trajectory reduction, and implemented it as a prototype extension of the symbolic model checker NuSMV. Unlike on-the-fly dynamic abstraction techniques, domain reduction abstraction statically analyzes specifications and automatically produces an abstract model which can be reused over time-a feature suitable for regression verification.

Original languageEnglish (US)
Title of host publicationProceedings - 18th IEEE International Conference on Automated Software Engineering, ASE 2003
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages314-317
Number of pages4
ISBN (Electronic)0769520359, 9780769520353
DOIs
StatePublished - 2003
Event18th IEEE International Conference on Automated Software Engineering, ASE 2003 - Montreal, Canada
Duration: Oct 6 2003Oct 10 2003

Publication series

NameProceedings - 18th IEEE International Conference on Automated Software Engineering, ASE 2003

Conference

Conference18th IEEE International Conference on Automated Software Engineering, ASE 2003
Country/TerritoryCanada
CityMontreal
Period10/6/0310/10/03

Bibliographical note

Publisher Copyright:
© 2003 IEEE

Fingerprint

Dive into the research topics of 'Model checking software requirement specifications using domain reduction abstraction'. Together they form a unique fingerprint.

Cite this