Automatic Verification of Parameterized Systems by Over-Approximation PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Automatic Verification of Parameterized Systems by Over-Approximation PDF full book. Access full book title Automatic Verification of Parameterized Systems by Over-Approximation by Vladislavs Jahundovics. Download full books in PDF and EPUB format.
Author: Vladislavs Jahundovics
Publisher: Linköping University Electronic Press
ISBN: 9176859185
Category :
Languages : en
Pages : 155
Get Book Here
Book Description
This thesis presents a completely automatic verification framework to check safety properties of parameterized systems. A parameterized system is a family of finite state systems where every system consists of a finite number of processes running in parallel the same algorithm. All the systems in the family differ only in the number of the processes and, in general, the number of systems in a family may be unbounded. Examples of parameterized systems are communication protocols, mutual exclusion protocols, cache coherence protocols, distributed algorithms etc. Model-checking of finite state systems is a well-developed formal verification approach of proving properties of systems in an automatic way. However, it cannot be applied directly to parameterized systems because the unbounded number of systems in a family means an infinite state space. In this thesis we propose to abstract an original family of systems consisting of an unbounded number of processes into one consisting of a fixed number of processes. An abstracted system is considered to consist of k+1 components—k reference processes and their environment. The transition relation for the abstracted system is an over-approximation of the transition relation for the original system, therefore, a set of reachable states of the abstracted system is an over-approximation of the set of reachable states of the original one. A safety property is considered to be parameterized by a fixed number of processes whose relationship is in the center of attention in the property. Such processes serve as reference processes in the abstraction. We propose an encoding which allows to perform reachability analysis for an abstraction parameterized by the reference processes. We have successfully verified three classic parameterized systems with replicated processes by applying this method.
Author: Vladislavs Jahundovics
Publisher: Linköping University Electronic Press
ISBN: 9176859185
Category :
Languages : en
Pages : 155
Get Book Here
Book Description
This thesis presents a completely automatic verification framework to check safety properties of parameterized systems. A parameterized system is a family of finite state systems where every system consists of a finite number of processes running in parallel the same algorithm. All the systems in the family differ only in the number of the processes and, in general, the number of systems in a family may be unbounded. Examples of parameterized systems are communication protocols, mutual exclusion protocols, cache coherence protocols, distributed algorithms etc. Model-checking of finite state systems is a well-developed formal verification approach of proving properties of systems in an automatic way. However, it cannot be applied directly to parameterized systems because the unbounded number of systems in a family means an infinite state space. In this thesis we propose to abstract an original family of systems consisting of an unbounded number of processes into one consisting of a fixed number of processes. An abstracted system is considered to consist of k+1 components—k reference processes and their environment. The transition relation for the abstracted system is an over-approximation of the transition relation for the original system, therefore, a set of reachable states of the abstracted system is an over-approximation of the set of reachable states of the original one. A safety property is considered to be parameterized by a fixed number of processes whose relationship is in the center of attention in the property. Such processes serve as reference processes in the abstraction. We propose an encoding which allows to perform reachability analysis for an abstraction parameterized by the reference processes. We have successfully verified three classic parameterized systems with replicated processes by applying this method.
Author: Edmund M. Clarke
Publisher: Springer
ISBN: 3319105752
Category : Computers
Languages : en
Pages : 1210
Get Book Here
Book Description
Model checking is a computer-assisted method for the analysis of dynamical systems that can be modeled by state-transition systems. Drawing from research traditions in mathematical logic, programming languages, hardware design, and theoretical computer science, model checking is now widely used for the verification of hardware and software in industry. The editors and authors of this handbook are among the world's leading researchers in this domain, and the 32 contributed chapters present a thorough view of the origin, theory, and application of model checking. In particular, the editors classify the advances in this domain and the chapters of the handbook in terms of two recurrent themes that have driven much of the research agenda: the algorithmic challenge, that is, designing model-checking algorithms that scale to real-life problems; and the modeling challenge, that is, extending the formalism beyond Kripke structures and temporal logic. The book will be valuable for researchers and graduate students engaged with the development of formal methods and verification tools.
Author: Daniel Geist
Publisher: Springer
ISBN: 3540397248
Category : Computers
Languages : en
Pages : 439
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 12th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods, CHARME 2003, held in L'Aquila, Italy in October 2003. The 24 revised full papers and 8 short papers presented were carefully reviewed and selected from 65 submissions. The papers are organized in topical sections on software verification, automata based methods, processor verification, specification methods, theorem proving, bounded model checking, and model checking and applications.
Author: Nicolas Halbwachs
Publisher: Springer Science & Business Media
ISBN: 9783540662020
Category : Computers
Languages : en
Pages : 524
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 11th International Conference on Computer Aided Verification, CAV'99, held in Trento, Italy in July 1999 as part of FLoC'99. The 34 revised full papers presented were carefully reviewed and selected from a total of 107 submissions. Also included are six invited contributions and five tool presentations. The book is organized in topical sections on processor verification, protocol verification and testing, infinite state spaces, theory of verification, linear temporal logic, modeling of systems, symbolic model checking, theorem proving, automata-theoretic methods, and abstraction.
Author: Holger Hermanns
Publisher: Springer
ISBN: 3540330577
Category : Computers
Languages : en
Pages : 519
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2005, held Austria in March/April 2006 as part of ETAPS. The 30 revised full research papers and four revised tool demonstration papers presented together with one invited paper were carefully reviewed and selected from a total of 118 submissions. The papers are organized in topical sections.
Author: Roberto Amadio
Publisher: Springer
ISBN: 3540451870
Category : Computers
Languages : en
Pages : 536
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 14th International Conference on Concurrency Theory, CONCUR 2003, held in Marseille, France in September 2003. The 29 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 107 submissions. The papers are organized in topical sections on partial orders and asynchronous systems, process algebras, games, infinite systems, probabilistic automata, model checking, model checking and HMSC, security, mobility, compositional methods and real time, and probabilistic models.
Author: Ed Brinksma
Publisher: Springer
ISBN: 3540456570
Category : Computers
Languages : en
Pages : 645
Get Book Here
Book Description
This volume contains the proceedings of the conference on Computer Aided V- i?cation (CAV 2002), held in Copenhagen, Denmark on July 27-31, 2002. CAV 2002 was the 14th in a series of conferences dedicated to the advancement of the theory and practice of computer-assisted formal analysis methods for software and hardware systems. The conference covers the spectrum from theoretical - sults to concrete applications, with an emphasis on practical veri?cation tools, including algorithms and techniques needed for their implementation. The c- ference has traditionally drawn contributions from researchers as well as prac- tioners in both academia and industry. This year we received 94 regular paper submissions out of which 35 were selected. Each submission received an average of 4 referee reviews. In addition, the CAV program contained 11 tool presentations selected from 16 submissions. For each tool presentation, a demo was given at the conference. The large number of tool submissions and presentations testi?es to the liveliness of the ?eld and its applied ?avor.
Author: Holger Giese
Publisher: Springer
ISBN: 3642307930
Category : Computers
Languages : en
Pages : 279
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 14th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems, FMOODS 2012, and the 32nd IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems, FORTE 2012, held in Stockholm, Sweden, in June 2012, as one of the DisCoTec 2012 events. The 16 revised full papers presented were carefully reviewed and selected from 42 submissions. They cover a wide range of topics combining theory and practice in application areas of telecommunication services, Internet, embedded and real-time systems, networking and communication security and reliability, sensor networks, service-oriented architecture, and Web services.
Author: Susanne Graf
Publisher: Springer
ISBN: 3540464190
Category : Computers
Languages : en
Pages : 570
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2000, held as part of ETAPS 2000 in Berlin, Germany, in March/April 2000. The 33 revised full papers presented together with one invited paper and two short tool descriptions were carefully reviewed and selected from a total of 107 submissions. The papers are organized in topical sections on software and formal methods, formal methods, timed and hybrid systems, infinite and parameterized systems, diagnostic and test generation, efficient model checking, model-checking tools, symbolic model checking, visual tools, and verification of critical systems.
Author: Cormac Flanagan
Publisher: Springer
ISBN: 3642287565
Category : Computers
Languages : en
Pages : 578
Get Book Here
Book Description
This book constitutes the proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2012, held as part of the joint European Conference on Theory and Practice of Software, ETAPS 2012, which took place in Tallinn, Estonia, in March/April 2012. The 25 research papers, 2 case study papers, 3 regular tool papers, and 6 tool demonstrations papers presented in this book were carefully reviewed and selected from a total of 147 submissions. The papers are organized in topical sections named: SAT and SMT based methods; automata; model checking; case studies; memory models and termination; internet protocol verification; stochastic model checking; synthesis; provers and analysis techniques; tool demonstrations; and competition on software verification.
