Compositional Reasoning in Model Checking

Berezin, Sergey; Campos, Sérgio Vale Aguiar; Clarke, Edmund M.

doi:10.1007/3-540-49213-5_4

Cited by 65 publications

(47 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There has been earlier work on reducing the cost of automated verification by analyzing dependencies such as cone of influence reduction [1] and program analysis based reductions [5]. Compared to these earlier results, our projection algorithm is a specialized reduction technique for data model verification that utilizes the data model semantics.…”

Section: Methodsmentioning

confidence: 94%

Unbounded data model verification using SMT solvers

Nijjar

Bultan

2012

Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering

View full text Add to dashboard Cite

The growing influence of web applications in every aspect of society makes their dependability an immense concern. A fundamental building block of web applications that use the Model-View-Controller (MVC) pattern is the data model, which specifies the object classes and the relations among them. We present an approach for unbounded, automated verification of data models that 1) extracts a formal data model from an Object Relational Mapping, 2) converts verification queries about the data model to queries about the satisfiability of formulas in the theory of uninterpreted functions, and 3) uses a Satisfiability Modulo Theories (SMT) solver to check the satisfiability of the resulting formulas. We implemented this approach and applied it to five opensource Rails applications. Our results demonstrate that the proposed approach is feasible, and is more efficient than SAT-based bounded verification.

show abstract

Section: Methodsmentioning

confidence: 94%

Unbounded data model verification using SMT solvers

Nijjar

Bultan

2012

Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering

View full text Add to dashboard Cite

show abstract

“…The same reduction steps are applied to the properties 3 H G , thus obtaining the corresponding flattened boolean versions 3 B F E G . In addition, by means of the cone of influence reduction [2], it is possible to restrict the analysis of each property to the relevant parts of the model…”

Section: B F Ementioning

confidence: 99%

NuSMV 2: An OpenSource Tool for Symbolic Model Checking

Cimatti¹,

Clarke

Giunchiglia

et al. 2002

Lecture Notes in Computer Science

1,237

901

View full text Add to dashboard Cite

This paper describes version 2 of the NuSMV tool. NuSMV is a symbolic model\ud checker originated from the reengineering, reimplementation and extension of\ud SMV, the original BDD-based model checker developed at CMU. The Nu-\ud SMV project aims at the development of a state-of-the-art symbolic model\ud checker, designed to be applicable in technology transfer projects: it is a well\ud structured, open, flexible and documented platform for model checking, and is\ud robust and close to industrial systems standards

show abstract

“…Assume-Guarantee reasoning [21,12,5] is one of the key techniques to alleviate state explosion in model checking. In a system composed of a number of reactive modules each module can be regarded as interacting with an abstract environment representing the rest of the system.…”

Section: Introductionmentioning

confidence: 99%

Assume-Guarantee Reasoning with Local Specifications

Lomuscio

Strulo

Walker

et al. 2010

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Abstract. We investigate assume-guarantee reasoning for global specifications consisting of conjunctions of local specifications. We present a sound and complete assume-guarantee rule that permits reasoning about individual modules for local specifications and draws conclusions on global specifications. We illustrate our approach with an example from the field of network congestion control, where different agents are responsible for controlling packet flow across a shared infrastructure. In this context, we derive an assume-guarantee rule for system stability, and show that this rule is valuable to reason about any number of agents, any initial flow configuration, and any topology of bounded degree.

show abstract

Compositional Reasoning in Model Checking

Cited by 65 publications

References 16 publications

Unbounded data model verification using SMT solvers

Unbounded data model verification using SMT solvers

NuSMV 2: An OpenSource Tool for Symbolic Model Checking

Assume-Guarantee Reasoning with Local Specifications

Contact Info

Product

Resources

About