Optimizing symbolic model checking for statecharts

Chan, William; Anderson, Richard; Beame, Paul; Jones, D. E.; Notkin, David; Warner, W.E.

doi:10.1109/32.908961

Cited by 27 publications

(10 citation statements)

References 38 publications

(55 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Chan et al [1998] have defined an algorithm for slicing RSML models for model checking. They have experimentally evaluated their slicing approach in Chan et al [2001] on two models, the TCAS II model [Heimdahl and Leveson 1995] and Boeing EPD (Electrical Power Distribution) case study [Nobe and Bingle 1998]. Results show that applying slicing to TCAS II reduces the Boolean state variables by half for four of the five properties.…”

Section: Model Checkingmentioning

confidence: 98%

See 1 more Smart Citation

State-based model slicing

et al. 2013

View full text Add to dashboard Cite

Slicing is a technique, traditionally applied to programs, for extracting the parts of a program that affect the values computed at a statement of interest. In recent years authors have begun to consider slicing at model level. We present a detailed review of existing work on slicing at the level of finite-state-machine-based models. We focus on state-based modeling notations because these have received sufficient attention from the slicing community that there is now a coherent body of hitherto unsurveyed work. We also identify the challenges that state-based slicing presents and how the existing literature has addressed these. We conclude by identifying problems that remain open either because of the challenges involved in addressing them or because the community simply has yet to turn its attention to solving them.

show abstract

Section: Model Checkingmentioning

confidence: 98%

“…The slicing algorithm [Chan et al 2001] is not minimal and may include false dependencies, that is, elements are shown to be dependent on each other when they should not be. Not only do false dependencies increase the size of the slice but they can mislead as to which elements actually affect the slicing criterion.…”

Section: Proposition-based Slicingmentioning

confidence: 99%

State-based model slicing

et al. 2013

View full text Add to dashboard Cite

show abstract

“…Microstep visibility has been used in (Chan et al, 2001), though for different purposes that are not directly applicable to our approach. These authors use a microstep counter to optimise the analysis of statechart-like specifications, making every macrostep equal in length to prune backward searches in BBD-based model checking.…”

Section: Microstep Countermentioning

confidence: 99%

Automatic generation of assumptions for modular verification of software specifications

Riva

Tuya

2006

Journal of Systems and Software

View full text Add to dashboard Cite

Abstract. Model checking is a powerful automated technique mainly used for the verification of properties of reactive systems. In practice, model checkers are limited due to the state explosion problem. Modular verification based on the assume-guarantee paradigm mitigates this problem using a "divide and conquer" technique. Unfortunately, this approach is not automated, for the reason that the user must specify the environment model. In this paper, a novel technique is presented for automatically generating component assumptions based on the behaviour of the environment (the remainder of components of the systems). In a first phase, the environment of the component is computed using state space exploration techniques, and then the assumptions are generated as association rules of the component environment interface. This approach presents a number of advantages. Firstly, user assistance to specify assumptions is not necessary and assumption discharge is avoided. Secondly, the component assumptions are more restrictive and real, and therefore reduce the resources needed by the model checker. The technique is applied to the specification of a steam boiler system.

show abstract

“…For example, model checking frameworks have been applied to reason about software process models (e.g., [25]), software requirements models (e.g., [5]), architectural frameworks (e.g., [19,26]), design models (e.g., [1,22]), and system implementations (e.g., [3,8,20]). The effectiveness of these efforts has in most cases relied on detailed knowledge of the model checking framework being applied.…”

Section: Introductionmentioning

confidence: 99%

“…The effectiveness of these efforts has in most cases relied on detailed knowledge of the model checking framework being applied. In some cases, a new framework was developed that was targeted to the semantics of a family of artifacts [3,20], while in other cases it was necessary to study an existing model checking framework in detail in order to customize it [5,10]. Unfortunately, this level of knowledge and effort currently prevents many domain experts from successfully applying model checking to software analysis.…”

Section: Introductionmentioning

confidence: 99%

Bogor

Robby

Dwyer

Hatcliff

2003

SIGSOFT Softw. Eng. Notes

View full text Add to dashboard Cite

Model checking is emerging as a popular technology for reasoning about behavioral properties of a wide variety of software artifacts including: requirements models, architectural descriptions, designs, implementations, and process models. The complexity of model checking is well-known, yet costeffective analyses have been achieved by exploiting, for example, naturally occurring abstractions and semantic properties of target software artifacts. Adapting a model checking tool to exploit this kind of domain knowledge often requires in-depth knowledge of the tool's implementation.We believe that with appropriate tool support, domain experts will be able to develop efficient model checking-based analyses for a variety of software-related models. To explore this hypothesis, we have developed Bogor, a model checking framework with an extensible input language for defining domain-specific constructs and a modular interface design to ease the optimization of domain-specific state-space encodings, reductions and search algorithms. We present the pattern-oriented design of Bogor and discuss our experiences adapting it to efficiently model check Java programs and event-driven component-based designs.

show abstract

Optimizing symbolic model checking for statecharts

Cited by 27 publications

References 38 publications

State-based model slicing

State-based model slicing

Automatic generation of assumptions for modular verification of software specifications

Bogor

Contact Info

Product

Resources

About