Download or read book Improving State Exploration Techniques for the Automatic Verification of Concurrent Systems written by Johannes J. M. Van der Schoot and published by . This book was released on 1999 with total page 396 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Improving State Exploration Techniques for the Automatic Verification of Concurrent Systems written by and published by . This book was released on 1999 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Automatic Verification Methods for Finite State Systems written by Joseph Sifakis and published by Springer Science & Business Media. This book was released on 1990-01-10 with total page 392 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume contains the proceedings of a workshop held in Grenoble in June 1989. This was the first workshop entirely devoted to the verification of finite state systems. The workshop brought together researchers and practitioners interested in the development and use of methods, tools and theories for automatic verification of finite state systems. The goal at the workshop was to compare verification methods and tools to assist the applications designer. The papers in this volume review verification techniques for finite state systems and evaluate their relative advantages. The techniques considered cover various specification formalisms such as process algebras, automata and logics. Most of the papers focus on exploitation of existing results in three application areas: hardware design, communication protocols and real-time systems.
Download or read book Parameterized Verification of Synchronized Concurrent Programs written by Zeinab Ganjei and published by Linköping University Electronic Press. This book was released on 2021-03-19 with total page 192 pages. Available in PDF, EPUB and Kindle. Book excerpt: There is currently an increasing demand for concurrent programs. Checking the correctness of concurrent programs is a complex task due to the interleavings of processes. Sometimes, violation of the correctness properties in such systems causes human or resource losses; therefore, it is crucial to check the correctness of such systems. Two main approaches to software analysis are testing and formal verification. Testing can help discover many bugs at a low cost. However, it cannot prove the correctness of a program. Formal verification, on the other hand, is the approach for proving program correctness. Model checking is a formal verification technique that is suitable for concurrent programs. It aims to automatically establish the correctness (expressed in terms of temporal properties) of a program through an exhaustive search of the behavior of the system. Model checking was initially introduced for the purpose of verifying finite‐state concurrent programs, and extending it to infinite‐state systems is an active research area. In this thesis, we focus on the formal verification of parameterized systems. That is, systems in which the number of executing processes is not bounded a priori. We provide fully-automatic and parameterized model checking techniques for establishing the correctness of safety properties for certain classes of concurrent programs. We provide an open‐source prototype for every technique and present our experimental results on several benchmarks. First, we address the problem of automatically checking safety properties for bounded as well as parameterized phaser programs. Phaser programs are concurrent programs that make use of the complex synchronization construct of Habanero Java phasers. For the bounded case, we establish the decidability of checking the violation of program assertions and the undecidability of checking deadlock‐freedom. For the parameterized case, we study different formulations of the verification problem and propose an exact procedure that is guaranteed to terminate for some reachability problems even in the presence of unbounded phases and arbitrarily many spawned processes. Second, we propose an approach for automatic verification of parameterized concurrent programs in which shared variables are manipulated by atomic transitions to count and synchronize the spawned processes. For this purpose, we introduce counting predicates that related counters that refer to the number of processes satisfying some given properties to the variables that are directly manipulated by the concurrent processes. We then combine existing works on the counter, predicate, and constrained monotonic abstraction and build a nested counterexample‐based refinement scheme to establish correctness. Third, we introduce Lazy Constrained Monotonic Abstraction for more efficient exploration of well‐structured abstractions of infinite‐state non‐monotonic systems. We propose several heuristics and assess the efficiency of the proposed technique by extensive experiments using our open‐source prototype. Lastly, we propose a sound but (in general) incomplete procedure for automatic verification of safety properties for a class of fault‐tolerant distributed protocols described in the Heard‐Of (HO for short) model. The HO model is a popular model for describing distributed protocols. We propose a verification procedure that is guaranteed to terminate even for unbounded number of the processes that execute the distributed protocol.
Download or read book Proceedings of the Estonian Academy of Sciences Physics and Mathematics written by and published by . This book was released on 1998-09 with total page 104 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Dissertation Abstracts International written by and published by . This book was released on 2008 with total page 980 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Model Checking Software written by Matthew Dwyer and published by Springer Science & Business Media. This book was released on 2001-05-02 with total page 322 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 8th International SPIN Workshop held in Toronto, Canada, in May 2001. The SPIN model checker is one of the most powerful and popular systems for the analysis and verification of distributed and concurrent systems. The 13 revised full papers presented together with one invited survey paper and three invited industrial experience reports were carefully reviewed and selected from 26 submissions. Besides foundational issues of program analysis and formal verification, the papers focus on tools for model checking and practical applications in a variety of fields.
Download or read book Formal Techniques for Networked and Distributed Systems FORTE 2002 written by Doron Peled and published by Springer Science & Business Media. This book was released on 2002-10-28 with total page 382 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 22nd IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems, FORTE 2002, held in Houston, Texas, USA in November 2002. The 22 revised full papers, 2 tool papers, and 2 posters presented were carefully reviewed and selected from 61 submissions. All current aspects of formal method for distributed systems and communication protocols are addressed, in particular formal specification, testing, and verification of such systems.
Download or read book Model Checking Software written by Dragan Bosnacki and published by Springer. This book was released on 2003-08-01 with total page 268 pages. Available in PDF, EPUB and Kindle. Book excerpt: The SPIN workshop series brings together researchers and practitioners int- ested in explicit state model checking technology as it is applied to the veri?- tion of software systems. Since 1995, when the SPIN workshop series was instigated, SPIN workshops have been held on an annual basis at Montr ́ eal (1995), New Brunswick (1996), Enschede (1997), Paris (1998), Trento (1999), Toulouse (1999), Stanford (2000), andToronto(2001). Whilethe?rstSPINworkshopwasastand-aloneevent,later workshopshavebeenorganizedasmoreorlesscloselya?liatedeventswithlarger conferences, in particular with CAV (1996), TACAS (1997), FORTE/PSTV (1998), FLOC (1999), World Congress on Formal Methods (1999), FMOODS (2000), and ICSE (2001). This year, SPIN 2002 was held as a satellite event of ETAPS 2002, the European Joint Conferences on Theory and Practice of Software. The co-location of SPIN workshops with conferences has proven to be very successful and has helped to disseminate SPIN model checking technology to wider audiences. Since 1999, the proceedings of the SPIN workshops have appeared in Springer-Verlag’s “Lecture Notes in Computer Science” series. The history of successful SPIN workshops is evidence for the maturing of model checking technology, not only in the hardware domain, but increasingly also in the software area. While in earlier years algorithms and tool development 1 around the SPIN model checker were the focus of this workshop series, the scopehasrecentlywidenedtoincludemoregeneralapproachestosoftwaremodel checking. Current research in this area concentrates not so much on completely verifyingsystemmodels,butratheronanalyzingsourcecodeinordertodiscover software faults.
Download or read book Verified Software Theories Tools Experiments written by Bertrand Meyer and published by Springer Science & Business Media. This book was released on 2008-07-07 with total page 566 pages. Available in PDF, EPUB and Kindle. Book excerpt: A Step Towards Verified Software Worries about the reliability of software are as old as software itself; techniques for allaying these worries predate even James King’s 1969 thesis on “A program verifier. ” What gives the whole topic a new urgency is the conjunction of three phenomena: the blitz-like spread of software-rich systems to control ever more facets of our world and our lives; our growing impatience with deficiencies; and the development—proceeding more slowly, alas, than the other two trends—of techniques to ensure and verify software quality. In 2002 Tony Hoare, one of the most distinguished contributors to these advances over the past four decades, came to the conclusion that piecemeal efforts are no longer sufficient and proposed a “Grand Challenge” intended to achieve, over 15 years, the production of a verifying compiler: a tool that while processing programs would also guarantee their adherence to specified properties of correctness, robustness, safety, security and other desirable properties. As Hoare sees it, this endeavor is not a mere research project, as might normally be carried out by one team or a small consortium of teams, but a momentous endeavor, comparable in its scope to the successful mission to send a man to the moon or to the sequencing of the human genome.
Download or read book Correct Hardware Design and Verification Methods written by Daniel Geist and published by Springer Science & Business Media. This book was released on 2003-10-10 with total page 439 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Download or read book Correct Hardware Design and Verification Methods written by Tiziana Margaria and published by Springer. This book was released on 2003-06-30 with total page 491 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume contains the proceedings of CHARME 2001, the Eleventh Advanced Research Working Conference on Correct Hardware Design and Veri?cation Methods. CHARME 2001 is the 11th in a series of working conferences devoted to the development and use of leading-edge formal techniques and tools for the design and veri?cation of hardware and hardware-like systems. Previous events in the ‘CHARME’ series were held in Bad Herrenalb (1999), Montreal (1997), Frankfurt (1995), Arles (1993), and Torino (1991). This series of meetings has been organized in cooperation with IFIP WG 10.5 and WG 10.2. Prior meetings, stretching backto the earliest days of formal hardware veri?cation, were held under various names in Miami (1990), Leuven (1989), Glasgow (1988), Grenoble (1986), Edinburgh (1985), and Darmstadt (1984). The convention is now well-established whereby the European CHARME conference alternates with its biennial counterpart, the International Conference on Formal Methods in Computer-Aided Design (FMCAD), which is held on even-numbered years in the USA. The conference tookplace during 4–7 September 2001 at the Institute for System Level Integration in Livingston, Scotland. It was co-hosted by the - stitute and the Department of Computing Science of Glasgow University and co-sponsored by the IFIP TC10/WG10.5 Working Group on Design and En- neering of Electronic Systems. CHARME 2001 also included a scienti?c session and social program held jointly with the 14th International Conference on Th- rem Proving in Higher Order Logics (TPHOLs), which was co-located in nearby Edinburgh.
Download or read book American Doctoral Dissertations written by and published by . This book was released on 1999 with total page 848 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Computer Aided Verification written by Costas Courcoubetis and published by Springer Science & Business Media. This book was released on 1993-06-16 with total page 520 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume contains the proceedings of the Fifth Conference on Computer-Aided Verfication, held in Crete, Greece, in June/July 1993. The objective of the CAV conferences is to bring together researchers and practitioners interested in the development anduse of methods, tools, and theories for the computer-aided verification of concurrent systems. The conferences provide an opportunity for comparing various verfication methods and tools that can be used to assist the applications designer. Emphasis is placed on new research results and the application of existing methods to real verification problems. The volume contains abstracts of three invited lectures and full versions of 37 contributed papers selected from 84 submissions.The contributions are grouped into sections on hardware verification with BDDs, methods and tools, theorem proving, analysis of real-time systems, process algebras and calculi, partial orders, and exploiting symmetry.
Download or read book Embedded Systems written by Fabrice Kordon and published by John Wiley & Sons. This book was released on 2013-05-06 with total page 310 pages. Available in PDF, EPUB and Kindle. Book excerpt: Since the construction of the first embedded system in the 1960s, embedded systems have continued to spread. They provide a continually increasing number of services and are part of our daily life. The development of these systems is a difficult problem which does not yet have a global solution. Another difficulty is that systems are plunged into the real world, which is not discrete (as is generally understood in computing), but has a richness of behaviors which sometimes hinders the formulation of simplifying assumptions due to their generally autonomous nature and they must face possibly unforeseen situations (incidents, for example), or even situations that lie outside the initial design assumptions. Embedded Systems presents the state of the art of the development of embedded systems and, in particular, concentrates on the modeling and analysis of these systems by looking at “model-driven engineering”, (MDE2): SysML, UML/MARTE and AADL. A case study (based on a pacemaker) is presented which enables the reader to observe how the different aspects of a system are addressed using the different approaches. All three systems are important in that they provide the reader with a global view of their possibilities and demonstrate the contributions of each approach in the different stages of the software lifecycle. Chapters dedicated to analyzing the specification and code generation are also presented. Contents Foreword, Brian R. Larson. Foreword, Dominique Potier. Introduction, Fabrice Kordon, Jérôme Hugues, Agusti Canals and Alain Dohet. Part 1. General Concepts 1. Elements for the Design of Embedded Computer Systems, Fabrice Kordon, Jérôme Hugues, Agusti Canals and Alain Dohet. 2. Case Study: Pacemaker, Fabrice Kordon, Jérôme Hugues, Agusti Canals and Alain Dohet. Part 2. SysML 3. Presentation of SysML Concepts, Jean-Michel Bruel and Pascal Roques. 4. Modeling of the Case Study Using SysML, Loïc Fejoz, Philippe Leblanc and Agusti Canals. 5. Requirements Analysis, Ludovic Apvrille and Pierre De Saqui-Sannes. Part 3. MARTE 6. An Introduction to MARTE Concepts, Sébastien Gérard and François Terrier. 7. Case Study Modeling Using MARTE, Jérôme Delatour and Joël Champeau. 8. Model-Based Analysis, Frederic Boniol, Philippe Dhaussy, Luka Le Roux and Jean-Charles Roger. 9. Model-Based Deployment and Code Generation, Chokri Mraidha, Ansgar Radermacher and Sébastien Gérard. Part 4. AADL 10. Presentation of the AADL Concepts, Jérôme Hugues and Xavier Renault. 11. Case Study Modeling Using AADL, Etienne Borde. 12. Model-Based Analysis, Thomas Robert and Jérôme Hugues. 13. Model-Based Code Generation, Laurent Pautet and Béchir Zalila.
Download or read book Formal Methods for Industrial Critical Systems written by Darren Cofer and published by Springer Science & Business Media. This book was released on 2009-07-27 with total page 242 pages. Available in PDF, EPUB and Kindle. Book excerpt: The aim of the FMICS workshop series is to provide a forum for researchers who are interested in the development and application of formal methods in industry. In particular, these workshops are intended to bring together scientists and practitioners who are active in the area of formal methods and interested in exchanging their experiences in the industrial usage of these methods. These workshopsalso striveto promoteresearchand developmentfor the improvement of formal methods and tools for industrial applications. The topics for which contributions to FMICS 2008 were solicited included, but were not restricted to, the following: – Design, speci?cation, code generation and testing based on formal methods – Veri?cation and validation of complex, distributed, real-time systems and embedded systems – Veri?cation and validation methods that address shortcomings of existing methods with respect to their industrial applicability (e. g. , scalability and usability issues) – Tools for the development of formal design descriptions – Case studies and experience reports on industrial applications of formal methods, focusing on lessons learned or identi?cation of new research - rections – Impact of the adoption of formal methods on the development process and associated costs – Application of formal methods in standardization and industrial forums The workshop included six sessions of regular contributions in the areas of model checking, testing, software veri?cation, real-time performance, and ind- trial case studies. There were also three invited presentations, given by Steven Miller,Rance Cleaveland,and Werner Damm, coveringthe applicationof formal methods in the avionics and automotive industries.
Download or read book Partial Order Methods for the Verification of Concurrent Systems written by Patrice Godefroid and published by Lecture Notes in Computer Science. This book was released on 1996-01-24 with total page 160 pages. Available in PDF, EPUB and Kindle. Book excerpt: This monograph is a revised version of the author's Ph.D. thesis, submitted to the University of Liège, Belgium, with Pierre Wolper as thesis advisor. The general pattern of this work, is to turn logical and semantic ideas into exploitable algorithms. Thus, it perfectly fits the modern trend, viewing verification as a computer-aided activity, and as algorithmic as possible, not as a paper and pencil one, dealing exclusively with semantic and logical issues. Patrice Godefroid uses state-space exploration as the key technique, which, as such or elaborated into model checking, is attracting growing attention for the verification of concurrent systems. For most realistic examples, the methods presented provide a significant reduction of memory and time requirements for protocol verification.
