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: Jiazhao (Jessie). Xu
Publisher:
ISBN:
Category :
Languages : en
Pages : 256
Get Book Here
Book Description
Author: Francesco Logozzo
Publisher: Springer
ISBN: 3540781633
Category : Computers
Languages : en
Pages : 333
Get Book Here
Book Description
This book contains the proceedings of VMCAI 2007. It features current research from the communities of verification, program certification, model checking, debugging techniques, abstract interpretation, abstract domains, and advancement of hybrid methods.
Author: Kenji Suzuki
Publisher: Springer Science & Business Media
ISBN: 3540688544
Category : Computers
Languages : en
Pages : 351
Get Book Here
Book Description
This volume contains the proceedings of FORTE 2008, 28th IFIP WG6.1 - ternational Conference on Formal Techniques for Networked and Distributed Systems. FORTE 2008 was held at the Campus Innovation Center in Tokyo, Japan during June 10–13, 2008. FORTE denotes a series of international wo- ing conferences on formal description techniques applied to computer networks and distributed systems. The conference series started in 1981 under the name PSTV. In 1988 a second series under the name FORTE was set up. Both - ries were united to FORTE/PSTV in 1996. In 2001 the conference changed the name to its current form. Recent conferences of this long series were held in Berlin (2003), Madrid(2004), Taipei(2005), Paris(2006), and Tallinn(2007). As in the previous year, FORTE 2008 was collocated with TESTCOM/ FATES 2008: the 20th IFIP International Conference on Testing of Com- nicating Systems (TESTCOM) and the 8th International Workshop on Formal Approaches to Testing of Software (FATES). The co-location of FORTE and TESTCOM/FATES fostered the collaboration between their communities. The commonspiritofboth conferenceswasunderpinnedby jointopening andclosing sessions, invited talks, as well as joint social events.
Author: David Lee
Publisher: Springer Science & Business Media
ISBN: 3642021379
Category : Computers
Languages : en
Pages : 260
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 11th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems, FMOODS 2009, and 29th IFIP WG 6.1 Formal Techniques for Networked and Distributed Systems, FORTE 2009, held in Lisboa, Portugal, in June 2009. The 12 revised full papers presented together with 6 short papers were carefully reviewed and selected from 42 submissions. The papers cover topics such as formal verification, algorithms and implementations, modeling and testing, process algebra and calculus as well as analysis of distributed systems.
Author: Paul Gastin
Publisher: Springer Science & Business Media
ISBN: 3642153747
Category : Computers
Languages : en
Pages : 613
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 20th International Conference on Concurrency Theory, CONCUR 2010, held in Paris, France, August 31 - September 3, 2010. The 35 revised full papers were carefully reviewed and selected from 107 submissions. The topics include: - Basic models of concurrency such as abstract machines, domain theoretic models, game theoretic models, process algebras, and Petri nets. - Logics for concurrency such as modal logics, probabilistic and stochastic logics, temporal logics, and resource logics. - Models of specialized systems such as biology-inspired systems, circuits, hybrid systems, mobile and collaborative systems, multi-core processors, probabilistic systems, real-time systems, service-oriented computing, and synchronous systems. - Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, pre-order and equivalence checking and run-time verification.
Author: John Törnblom
Publisher: Linköping University Electronic Press
ISBN: 917929748X
Category :
Languages : en
Pages : 22
Get Book Here
Book Description
In the presence of data and computational resources, machine learning can be used to synthesize software automatically. For example, machines are now capable of learning complicated pattern recognition tasks and sophisticated decision policies, two key capabilities in autonomous cyber-physical systems. Unfortunately, humans find software synthesized by machine learning algorithms difficult to interpret, which currently limits their use in safety-critical applications such as medical diagnosis and avionic systems. In particular, successful deployments of safety-critical systems mandate the execution of rigorous verification activities, which often rely on human insights, e.g., to identify scenarios in which the system shall be tested. A natural pathway towards a viable verification strategy for such systems is to leverage formal verification techniques, which, in the presence of a formal specification, can provide definitive guarantees with little human intervention. However, formal verification suffers from scalability issues with respect to system complexity. In this thesis, we investigate the limits of current formal verification techniques when applied to a class of machine learning models called tree ensembles, and identify model-specific characteristics that can be exploited to improve the performance of verification algorithms when applied specifically to tree ensembles. To this end, we develop two formal verification techniques specifically for tree ensembles, one fast and conservative technique, and one exact but more computationally demanding. We then combine these two techniques into an abstraction-refinement approach, that we implement in a tool called VoTE (Verifier of Tree Ensembles). Using a couple of case studies, we recognize that sets of inputs that lead to the same system behavior can be captured precisely as hyperrectangles, which enables tractable enumeration of input-output mappings when the input dimension is low. Tree ensembles with a high-dimensional input domain, however, seems generally difficult to verify. In some cases though, conservative approximations of input-output mappings can greatly improve performance. This is demonstrated in a digit recognition case study, where we assess the robustness of classifiers when confronted with additive noise.
Author: John S. Fitzgerald
Publisher: Springer
ISBN: 3540857621
Category : Computers
Languages : en
Pages : 466
Get Book Here
Book Description
Research on theoretical aspects of computing has a direct impact on the pr- tice of computer systems development. Over many decades, fundamental t- ories have emerged to describe functionality, temporal behavior and resource consumption. Theories of application domains are beginning to be exploited for modelling and analyzing intended computing systems before the expensive c- mitment is made to real programs and hardware. Recent years have seen major improvements in the cost-e?ectiveness of tools supporting the exploitation of theories through proof, model-checking and testing. Against this encouraging background, we are pleased to present papers that show something of the live- ness and diversity of research in theoretical aspects of computing today. ICTAC 2008, the 5th International Colloquium on Theoretical Aspects of Computing, was held on 1-3 September 2008 in Istanbul, Turkey, hosted by - banc? University. The ICTAC series was founded by the International Institute for SoftwareTechnologyof the United Nations University(UNU-IIST). It brings together practitioners and researchers from academia, industry and government to present results and to exchange ideas and experience addressing challenges in both theoretical aspects of computing and in the exploitation of theory through methodsandtoolsforsystemdevelopment. Theseriesalsopromotescooperation in research and education between participants and their institutions, from - veloping and industrial countries, in accordance with the mandate of the United Nations University. The previous ICTAC colloquia were held in Guiyang, China (2004, LNCS 3407), Hanoi, Vietnam (2005, LNCS 3722), Tunis, Tunisia (2006, LNCS 4281) and Macau SAR, China (2007, LNCS 4711).
Author:
Publisher:
ISBN: 9789155471385
Category :
Languages : en
Pages : 186
Get Book Here
Book Description
Author: Alessandro Gianola
Publisher: Springer Nature
ISBN: 3031427467
Category : Computers
Languages : en
Pages : 335
Get Book Here
Book Description
This book is a revised version of the PhD dissertation written by the author at the Free University of Bozen-Bolzano in Italy. It presents a new approach to safety verification of a particular class of infinite-state systems, called Data-Aware Processes (DAPs). To do so, the developed technical machinery requires to devise novel results for uniform interpolation and its combination in the context of automated reasoning. These results are then applied to the analysis of concrete business processes enriched with real data. In 2022, the PhD dissertation won the “BPM Dissertation Award”, granted to outstanding PhD theses in the field of Business Process Management.
