Verifying properties of large sets of processes with network invariants

Wolper, Pierre; Lovinfosse, Vinciane

doi:10.1007/3-540-52148-8_6

Cited by 142 publications

(98 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The verification of parametric systems consisting of n identical processes through abstraction, has been studied through the network invariants method of Wolper and Lovinfosse [WL89] and Kurshan and McMillan [KM89]. Lesens and Saïdi [LS97] combine predicate abstraction with a counting abstraction to verify parameterized networks of processes.…”

Section: Abstracting Parameterized Systemsmentioning

confidence: 99%

Verification by Abstraction

Shankar

2003

Formal Methods at the Crossroads. From Panacea to Foundational Support

View full text Add to dashboard Cite

Abstract. Verification seeks to prove or refute putative properties of a given program. Deductive verification is carried out by constructing a proof that the program satisfies its specification, whereas model checking uses state exploration to find computations where the property fails. Model checking is largely automatic but is effective only for programs defined over small state spaces. Abstraction serves as a bridge between the more general deductive methods for program verification and the restricted but effective state exporation methods used in model checking. In verification by abstraction, deduction is used to construct a finitestate approximation of a program that preserves the property of interest. The resulting abstraction can be explored for offending computations through the use of model checking. We motivate the use of abstraction in verification and survey some of the recent advances.

show abstract

Section: Abstracting Parameterized Systemsmentioning

confidence: 99%

Verification by Abstraction

Shankar

2003

Formal Methods at the Crossroads. From Panacea to Foundational Support

View full text Add to dashboard Cite

show abstract

“…However, for speci c families the problem can be solved. Most techniques are based on nding network invariants [47,74]. Given an in nite family F = fP i g 1 i=1 and a re exive, transitive relation , a n i n v ariant I is a process such that P i I for all i.…”

Section: Scope Of the Thesismentioning

confidence: 99%

“…The technique presented in this chapter is based on nding network invariants [47,74]. Given an in nite family F = fP i g 1 i=1 , this technique involves constructing an invariant I such that P i I for all i.…”

Section: Examplementioning

confidence: 99%

Symmetry and induction in model checking

Clarke

Jha

1995

Computer Science Today

View full text Add to dashboard Cite

With the increasing complexity of digital systems, testing of digital systems is becoming increasingly important. Perhaps, the most popular method for testing hardware is simulation. The incompleteness of simulation based testing methods has spurred the recent surge in the research on formal veri cation. In formal veri cation, one builds a precise model of the hardware under scrutiny and proves that the model satis es a speci cation of interest. For example, suppose one wants to verify that a router chip does not deadlock. In this case the user will build a precise model of the router and the speci cation will express the property of deadlock freedom. The two approaches to formal veri cation are model checking and theorem proving. In this thesis we will only discuss model checking. Most model checking procedures su er from the state explosion problem, i.e., the size of the state space of the system can be exponential in the number of state variables of the system. For certain systems, exploiting the inherent symmetry can alleviate the state-explosion problem. We discuss Model Checking procedures which exploit symmetry. Current model checkers can only verify a single state-transition system at a time. We also want to extend the model checking techniques to handle in nite families of nite-state systems. In practice, nite state concurrent systems often exhibit considerable symmetry. W e i n v estigate techniques for reducing the complexity o f temporal logic model checking in the presence of symmetry. In particular, we show that symmetry can frequently be used to reduce the size of the state space that must be explored during model checking. We also investigate complexity o f v arious problems related to exploiting symmetry in model checking. Partial order based reduction techniques exploit independence of actions. We demonstrate that partial order and symmetry based reduction techniques can be applied simultaneously. The ability to reason automatically about entire families of similar state-transition systems is an important research goal. Such families arise frequently in the design of reactive systems in both hardware and software. The in nite family of token rings is a simple example. More complicated examples are trees of processes consisting of one root, several internal and leaf nodes, and hierarchical buses with di erent n umbers of processors and caches. A technique for verifying entire families of state-transition systems based on network grammars and process invariants is presented here.

show abstract

“…(see, e.g., [AvJT96, BEM97, WB98, Boi99, AAB00, FS01, FL02]). On the other hand, a lot of work has been done for the verification of parameterized and dynamic networks of Boolean (or finite-data domain) processes, proposing either exact modelchecking and reachability analysis techniques for specific classes of systems (such as broadcast protocols, multithreaded programs, etc) [EN98, EFM99, DRB02, BT05, BMOT05], or generic algorithmic techniques (which can be approximate, or not guaranteed to terminate) such as network invariants-based approaches [WL89,CGJ97], and (abstract) regular model checking [BJNT00, Bou01, AJNS04, BHV04]. However, only few works consider both infinite data manipulation and parametric/dynamic network structures (see the paragraph on related work).…”

Section: Introductionmentioning

confidence: 99%

A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes

Bouajjani¹,

Drăgoi²,

Enea³

et al. 2009

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. We propose a framework for reasoning about unbounded dynamic networks of infinite-state processes. We propose Constrained Petri Nets (CPN) as generic models for these networks. They can be seen as Petri nets where tokens (representing occurrences of processes) are colored by values over some potentially infinite data domain such as integers, reals, etc. Furthermore, we define a logic, called CML (colored markings logic), for the description of CPN configurations. CML is a first-order logic over tokens allowing to reason about their locations and their colors. Both CPNs and CML are parametrized by a color logic allowing to express constraints on the colors (data) associated with tokens.We investigate the decidability of the satisfiability problem of CML and its applications in the verification of CPNs. We identify a fragment of CML for which the satisfiability problem is decidable (whenever it is the case for the underlying color logic), and which is closed under the computations of post and pre images for CPNs. These results can be used for several kinds of analysis such as invariance checking, pre-post condition reasoning, and bounded reachability analysis.

show abstract

Verifying properties of large sets of processes with network invariants

Cited by 142 publications

References 21 publications

Verification by Abstraction

Verification by Abstraction

Symmetry and induction in model checking

A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes

Contact Info

Product

Resources

About