IIV: An Invisible Invariant Verifier

Balaban, Ittai; Fang, Yi; Pnueli, Amir; Zuck, Lenore D.

doi:10.1007/11513988_39

Cited by 18 publications

(33 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This method has been implemented with TLV [40]. This implementation proves mutual exclusion, and other properties, for several of the examples (including the more difficult ones) from [4]. Preliminary results are shown in Figure 2; details are at http://www.cs.bell-labs.com/who/kedar/split-invariance .…”

Section: Theoremmentioning

confidence: 75%

“…On the enter-pme example, auxiliary variables reduce the computed invariant from a 9-quantifier mixed universal-existential assertion [4] to a 1-quantifier universal assertion that requires 2 seconds to compute vs. the 210 seconds required by IIV. Devising a systematic procedure for introducing such variables is still an important open question, the "environment abstraction" ideas from [10] may be of help here.…”

Section: Methodsmentioning

confidence: 99%

“…On the other hand, the authors point out that this method is not guaranteed to succeed-even if a suitable invariant exists, the generalization from the reachable states may fail. This is not merely a theoretical possibility, it does occur for some protocols [4].…”

Section: Parameterized Invariants and Non-interferencementioning

confidence: 98%

“…In the original paper and in subsequent work [3,4], the authors showed, remarkably, that this fairly simple heuristic suffices to show correctness of a number of parameterized protocols, by generating sufficiently strong invariants. On the other hand, the authors point out that this method is not guaranteed to succeed-even if a suitable invariant exists, the generalization from the reachable states may fail.…”

Section: Parameterized Invariants and Non-interferencementioning

confidence: 99%

“…The computation of K-split invariants on general BDS's does not necessarily produce assertions that are expressible in the logic L. In order to ensure this, let α i be the closure operator, defined as follows: α K i (S), for an index i ∈ [K] and a set of states S in M (K), is the smallest superset of S that is expressible in the logic L together with the assertion y = i for each T 1 variable y (this is well-defined if L is closed under arbitrary intersection). The closure operator can be computed using BDD's if L is based on a finite set of predicates 4 .…”

Section: Quantified Inductive Invariantsmentioning

confidence: 99%

See 4 more Smart Citations

Symmetry and Completeness in the Analysis of Parameterized Systems

Namjoshi

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Parameterized systems (e.g., network protocols) are compositions of a number of isomorphic, finite-state processes. While correctness is decidable for any fixed-size instance, correctness over all instances is undecidable in general. Typical proof methods, such as those based on process invariants or cutoffs, rely on summarizing the behavior of a parameterized system by a finite-state process. While these methods have been applied successfully to particular protocols, it is unknown whether such summarization is always possible. In this paper, it is shown that-after essential modifications-the cutoff method (which has the most stringent requirements) is complete for safety properties. The proof also shows that cutoff proofs are equivalent to determining inductive invariants. The paper studies this question next, presenting a new algorithm to construct universally quantified inductive invariants. The algorithm computes the strongest invariant of a given shape, and is therefore complete. The key to this result is a previously unnoticed connection between inductiveness, small model theorems, and compositional analysis, which is interesting in its own right.

show abstract

Section: Theoremmentioning

confidence: 75%

Section: Methodsmentioning

confidence: 99%

Section: Parameterized Invariants and Non-interferencementioning

confidence: 98%

Section: Parameterized Invariants and Non-interferencementioning

confidence: 99%

Section: Quantified Inductive Invariantsmentioning

confidence: 99%

See 3 more Smart Citations

Symmetry and Completeness in the Analysis of Parameterized Systems

Namjoshi

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Invisible Safety of Distributed Protocols

Balaban

Pnueli

Zuck

2006

Automata, Languages and Programming

View full text Add to dashboard Cite

Liveness by Invisible Invariants

Fang

McMillan

Pnueli

et al. 2006

Lecture Notes in Computer Science

Self Cite

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

IIV: An Invisible Invariant Verifier

Cited by 18 publications

References 5 publications

Symmetry and Completeness in the Analysis of Parameterized Systems

Symmetry and Completeness in the Analysis of Parameterized Systems

Invisible Safety of Distributed Protocols

Liveness by Invisible Invariants

Contact Info

Product

Resources

About