Model Sketching by Abstraction Refinement for Lifted Model Checking (Extended Version)

12/21/2021
by   Aleksandar S. Dimovski, et al.
0

In this work, we show how the use of verification and analysis techniques for model families (software product lines) with numerical features provides an interesting technique to synthesize complete models from sketches (i.e.partial models with holes). In particular, we present an approach for synthesizing Promela model sketches using variability-specific abstraction refinement for lifted (family-based) model checking.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/14/2019

Variability Abstraction and Refinement for Game-based Lifted Model Checking of full CTL (Extended Version)

Variability models allow effective building of many custom model variant...
research
01/26/2018

Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF

Model checking invariant properties of designs, represented as transitio...
research
02/15/2019

Shepherding Hordes of Markov Chains

This paper considers large families of Markov chains (MCs) that are defi...
research
08/22/2017

Scheduling Constraint Based Abstraction Refinement for Multi-Threaded Program Verification

Bounded model checking is among the most efficient techniques for the au...
research
02/14/2018

Abstract Family-based Model Checking using Modal Featured Transition Systems: Preservation of CTL* (Extended Version)

Variational systems allow effective building of many custom variants by ...
research
12/30/2017

Heuristics for Selecting Predicates for Partial Predicate Abstraction

In this paper we consider the problem of configuring partial predicate a...
research
03/10/2022

A Benchmark for Active Learning of Variability-Intensive Systems

Behavioral models are the key enablers for behavioral analysis of Softwa...

Please sign up or login with your details

Forgot password? Click here to reset