Reducing Model Checking of the Many to the Few

Emerson, E. Allen; Kahlon, Vineet

doi:10.1007/10721959_19

Cited by 159 publications

(184 citation statements)

References 22 publications

Supporting

Mentioning

180

Contrasting

Unclassified

Order By: Relevance

“…Similarly to other approaches [14,15,17] we are interested only in the properties that are invariant under stuttering (defined below). The definition of the invariant under stuttering formulas cannot be straightforwardly used for deciding whether a formula is invariant under stuttering.…”

Section: The Logic For Specifying Propertiesmentioning

confidence: 99%

“…We study the sequences for which there exists m ∈ N 0 such that if for an arbitrary n ∈ N a path fails to satisfy ϕ n , then there are m users that together with the control component ensure that the path fails to satisfy ϕ n (similarly to [13,14]). A property satisfying this condition for m ∈ N 0 is called m-symmetric property.…”

Section: C-u Model Propertiesmentioning

confidence: 99%

See 1 more Smart Citation

Formal verification of systems with an unlimited number of components

et al. 2008

View full text Add to dashboard Cite

2 3In many real component-based systems and patterns of component interaction, there can be identified a stable part (like control component, server, instance handler) and a number of uniform components of the same type (users, clients, instances). Such systems, so called Control-User systems, are often modelled using an infinite set of finite models of particular components, parametrised by the number of uniform components in the system. However if the maximal number of components is not known, this results in infinite-state models, which cannot be directly verified with effective (finite-state) techniques, like model checking. In this case, more involved techniques have to be employed.In this paper, we propose a verification technique for checking LTL-like interaction properties on Control-User systems with unlimited number of components using finite-state verification. Our method is based on com-

show abstract

Section: The Logic For Specifying Propertiesmentioning

confidence: 99%

Section: C-u Model Propertiesmentioning

confidence: 99%

Formal verification of systems with an unlimited number of components

et al. 2008

View full text Add to dashboard Cite

show abstract

“…One approach to remedy this situation, pursued, e.g., in [EK00], is to look for restricted families of parameterized systems for which the problem becomes decidable. Unfortunately, the proposed restrictions are very severe and exclude many useful systems such as asynchronous systems where processes communicate by shared variables.…”

Section: I K P( I)mentioning

confidence: 99%

Liveness by Invisible Invariants

Fang

McMillan

Pnueli

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The method of Invisible Invariants was developed in order to verify safety properties of parametrized systems in a fully automatic manner. In this paper, we apply the method of invisible invariant to "bounded response" properties, i.e., liveness properties of the type p =⇒ ½ q that are bounded -once a p-state is reached, it takes a bounded number of rounds (where a round is a sequence of steps in which each process has been given a chance to proceed) to reach a q-state -thus, they are essentially safety properties.With a "liveness monitor" that observes certain behavior of a system, establishing "bounded response" properties over the system is reduced to the verification of invariant properties.It is often the case that the inductive invariants for systems with "liveness monitors" contain assertions of a certain form that the original method of invisible invariant is not able to generate, nor to check inductiveness. To accommodate invariants of such forms, we extend the techniques used for invariant generation, as well as the small model theorem for validity check.

show abstract

“…[1,8,2,25]), structural induction for proving properties for arbitrary number of processes (c.f. [19,9,15,13,10,4]), data abstraction (c.f. [32,17]), use of term rewrite systems for hardware verification [5], and proving refinement using reachability analysis (c.f.…”

Section: Related Workmentioning

confidence: 99%

Verifying Safety of a Token Coherence Implementation by Parametric Compositional Refinement

Burckhardt

Alur

Martin

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We combine compositional reasoning and reachability analysis to formally verify the safety of a recent cache coherence protocol. The protocol is a detailed implementation of token coherence, an approach that decouples correctness and performance. First, we present a formal and abstract specification that captures the safety substrate of token coherence, and highlights the symmetry in states of the cache controllers and contents of the messages they exchange. Then, we prove that this abstract specification is coherent, and check whether the implementation proposed by the protocol designers is a refinement of the abstract specification. Our refinement proof is parametric in the number of cache controllers, and is compositional as it reduces the refinement checks to individual controllers using a specialized form of assume-guarantee reasoning. The individual refinement obligations are discharged using refinement maps and reachability analysis. While the formal proof justifies the intuitive claim by the designers about the ease of verifiability of token coherence, we report on several bugs in the implementation, and accompanying modifications, that were missed by extensive prior simulations.

show abstract

Reducing Model Checking of the Many to the Few

Cited by 159 publications

References 22 publications

Formal verification of systems with an unlimited number of components

Formal verification of systems with an unlimited number of components

Liveness by Invisible Invariants

Verifying Safety of a Token Coherence Implementation by Parametric Compositional Refinement

Contact Info

Product

Resources

About