Computer-Aided Verification of Coordinating Processes

Kurshan, Robert P.

doi:10.1515/9781400864041

Cited by 444 publications

(475 citation statements)

References 0 publications

Supporting

Mentioning

473

Contrasting

Unclassified

Order By: Relevance

“…Moreover, we keep only one value in the abstract domain. Our approach is also related to other works on cone-ofinfluence reduction [10]. However, our method is more efficient because we analyze the dependency between the values of variables in addition to the dependency between variables, thus the dependency relation is more accurate.…”

Section: Syntactic Model Reductionmentioning

confidence: 98%

See 1 more Smart Citation

Compositional Verification of a Switch Fabric from Nortel Networks

Peng

Tahar

Mokhtari

2003

Formal Methods and Software Engineering

View full text Add to dashboard Cite

With the development of ASIC designs, simulation cannot cover all the corner cases in a complicated design. Model checking is a fully automatic approach to verify a finite state machine against its temporal specifications. However, its application is limited by the size of the system to be verified. Compositional verification and model reduction are two possible methods to tackle this problem. In this paper, we propose a verification framework based on assumeguarantee compositional model checking, where we can apply model checking to do exhaustive verification at the module level and conduct global properties via compositional reasoning. In this framework, temporal specifications are synthesized into Verilog modules. In case a module under verification is beyond the capability of model checking, the proposed model reduction algorithm is used. We implemented the framework on top of the VIS tool and applied it on an ATM switch fabric from Nortel Networks.

show abstract

Section: Syntactic Model Reductionmentioning

confidence: 98%

“…One popular abstraction technique is the cone of influence reduction (COI) [10]. This method decreases the size of the concrete system by focusing on the variables of the concrete system that are referred to in the property and eliminating variables that do not influence the variables of interest in the property.…”

Section: Syntactic Model Reductionmentioning

confidence: 99%

Compositional Verification of a Switch Fabric from Nortel Networks

Peng

Tahar

Mokhtari

2003

Formal Methods and Software Engineering

View full text Add to dashboard Cite

show abstract

“…Common specification formalisms are based on temporal logic [Pnu81] and automata on infinite words [Kur94,VW94]. Such formalisms are very expressive, for example automata over infinite objects can specify all ω-regular properties.…”

mentioning

confidence: 99%

On Locally Checkable Properties

Kupferman

Lustig

Vardi

2006

Logic for Programming, Artificial Intelligence, and Reasoning

View full text Add to dashboard Cite

Abstract. The large computational price of formal verification of general ω-regular properties has led to the study of restricted classes of properties, and to the development of verification methodologies for them. Examples that have been widely accepted by the industry include the verification of safety properties, and bounded model checking. We introduce and study another restricted class of properties -the class of locally checkable properties. For an integer k ≥ 1, a language L ⊆ Σ ω is k-checkable if there is a language R ⊆ Σ k (of "allowed subwords") such that a word w belongs to L iff all the subwords of w of length k belong to R. A property is locally checkable if its language is k-checkable for some k. Locally checkable properties, which are a special case of safety properties, are common in the specification of systems. In particular, one can often bound an eventuality constraint in a property by a fixed time frame. The practical importance of locally checkable properties lies in the low memory demand for their run-time verification. A monitor for a k-checkable property needs only a record of the last k computation cycles. Furthermore, even if a large number of k-checkable properties are monitored, the monitors can share their memory, resulting in memory demand that do not depend on the number of properties monitored. This advantage of locally checkable properties makes them particularly suitable for run-time verification. In the paper, we define locally checkable languages, study their relation to other restricted classes of properties, study the question of deciding whether a property is locally checkable, and study the relation between the size of the property (specified by an LTL formula or an automaton) and the smallest k for which the property is k-checkable.

show abstract

“…More generally, LTL model checking can be done through reduction to automaton nonemptiness as shown by Vardi and Wolper [VW86], and independently by Kurshan (cf. [Ku94]). The automata-theoretic approach readily generalizes to a broader class of linear formalisms than just LTL.…”

Section: Model Checking Todaymentioning

confidence: 99%

“…Repeatedly refining it as needed and as resources permit typically leads to determination of correctness vs. incorrectness for M (cf. [Ku94]). …”

Section: Model Checking Todaymentioning

confidence: 99%

The Beginning of Model Checking: A Personal Perspective

Emerson

25 Years of Model Checking

View full text Add to dashboard Cite

Abstract. Model checking provides an automated method for verifying concurrent systems. Correctness specifications are given in temporal logic. The method hinges on an efficient and flexible graph-theoretic reachability algorithm. At the time of its introduction in the early 1980's, the prevailing paradigm for verification was a manual one of prooftheoretic reasoning using formal axioms and inference rules oriented towards sequential programs. The need to encompass concurrent programs, the desire to avoid the difficulties with manual deductive proofs, and the small model theorem for temporal logic motivated the development of model checking.

show abstract

Computer-Aided Verification of Coordinating Processes

Cited by 444 publications

References 0 publications

Compositional Verification of a Switch Fabric from Nortel Networks

Compositional Verification of a Switch Fabric from Nortel Networks

On Locally Checkable Properties

The Beginning of Model Checking: A Personal Perspective

Contact Info

Product

Resources

About