Symbolic model checking of software product lines

We study the problem of model checking software product line (SPL) behaviours against temporal properties. This is more difficult than for single systems because an SPL with n features yields up to 2n individual systems to verify. As each individual verification suffers from state explosion, it is c...

Full description

Saved in:
Bibliographic Details
Published in:2011 33rd International Conference on Software Engineering (ICSE) pp. 321 - 330
Main Authors: Classen, Andreas, Heymans, Patrick, Schobbens, Pierre-Yves, Legay, Axel
Format: Conference Proceeding
Language:English
Published: New York, NY, USA ACM 21.05.2011
IEEE
Series:ACM Conferences
Subjects:
Boolean functions
Computational modeling
Encoding
Explosions
features
Rain
Semantics
Software
Software and its engineering > Software creation and management > Software verification and validation > Formal software verification
Software and its engineering > Software organization and properties > Software functional properties > Formal methods
Software and its engineering > Software organization and properties > Software functional properties > Formal methods > Model checking
software product lines
specification
Theory of computation > Logic > Verification by model checking
software product lines
features
specification
ISBN:9781450304450, 1450304451
ISSN:0270-5257
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first