New Methods Of Concurrent Checking

Author : Michael Gössel
Publisher : Springer Science & Business Media
ISBN 13 : 140208420X
Total Pages : 186 pages
Book Rating : 4.01/5 ( download)

DOWNLOAD NOW!

Download or read book New Methods of Concurrent Checking written by Michael Gössel and published by Springer Science & Business Media. This book was released on 2008-04-26 with total page 186 pages. Available in PDF, EPUB and Kindle. Book excerpt: Computers are everywhere around us. We, for example, as air passengers, car drivers, laptop users with Internet connection, cell phone owners, hospital patients, inhabitants in the vicinity of a nuclear power station, students in a digital library or customers in a supermarket are dependent on their correct operation. Computers are incredibly fast, inexpensive and equipped with almost unimag- able large storage capacity. Up to 100 million transistors per chip are quite common today - a single transistor for each citizen of a large capital city in the world can be 2 easily accommodated on an ordinary chip. The size of such a chip is less than 1 cm . This is a fantastic achievement for an unbelievably low price. However, the very small and rapidly decreasing dimensions of the transistors and their connections over the years are also the reason for growing problems with reliability that will dramatically increase for the nano-technologies in the near future. Can we always trust computers? Are computers always reliable? Are chips suf- ciently tested with respect to all possible permanent faults if we buy them at a low price or have errors due to undetected permanent faults to be discovered by c- current checking? Besides permanent faults, many temporary or transient faults are also to be expected.

Author : Michael Gössel
Publisher : Springer
ISBN 13 : 9789048117536
Total Pages : 182 pages
Book Rating : 4.34/5 ( download)

DOWNLOAD NOW!

Download or read book New Methods of Concurrent Checking written by Michael Gössel and published by Springer. This book was released on 2009-08-29 with total page 182 pages. Available in PDF, EPUB and Kindle. Book excerpt: Computers are everywhere around us. We, for example, as air passengers, car drivers, laptop users with Internet connection, cell phone owners, hospital patients, inhabitants in the vicinity of a nuclear power station, students in a digital library or customers in a supermarket are dependent on their correct operation. Computers are incredibly fast, inexpensive and equipped with almost unimag- able large storage capacity. Up to 100 million transistors per chip are quite common today - a single transistor for each citizen of a large capital city in the world can be 2 easily accommodated on an ordinary chip. The size of such a chip is less than 1 cm . This is a fantastic achievement for an unbelievably low price. However, the very small and rapidly decreasing dimensions of the transistors and their connections over the years are also the reason for growing problems with reliability that will dramatically increase for the nano-technologies in the near future. Can we always trust computers? Are computers always reliable? Are chips suf- ciently tested with respect to all possible permanent faults if we buy them at a low price or have errors due to undetected permanent faults to be discovered by c- current checking? Besides permanent faults, many temporary or transient faults are also to be expected.

Author : Patrice Godefroid
Publisher : Lecture Notes in Computer Science
ISBN 13 :
Total Pages : 160 pages
Book Rating : 4.64/5 ( download)

DOWNLOAD NOW!

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.

Author : Stefan Edelkamp
Publisher : Springer Science & Business Media
ISBN 13 : 3540741275
Total Pages : 193 pages
Book Rating : 4.75/5 ( download)

DOWNLOAD NOW!

Download or read book Model Checking and Artificial Intelligence written by Stefan Edelkamp and published by Springer Science & Business Media. This book was released on 2007-08-09 with total page 193 pages. Available in PDF, EPUB and Kindle. Book excerpt: The refereed post-proceedings of the 4th Workshop on Model Checking and Artificial Intelligence are presented in this volume. Eight full workshop papers are presented along with three post-proceedings papers. Papers are organized into topical sections covering planning and model checking, heuristics for real-time model checking, verification of multi-agent systems, and logics for model checking and artificial intelligence.

Author : Tiago Massoni
Publisher : Springer
ISBN 13 : 303003044X
Total Pages : 271 pages
Book Rating : 4.45/5 ( download)

DOWNLOAD NOW!

Download or read book Formal Methods: Foundations and Applications written by Tiago Massoni and published by Springer. This book was released on 2018-11-19 with total page 271 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 21st Brazilian Symposium on Formal Methods, SBMF 2018, which took place in Salvador, Brazil, in November 2018. The 16 regular papers presented in this book were carefully reviewed and selected from 30 submissions. The papers are organized in topical sections such as: techniques and methodologies; specification and modeling languages; theoretical foundations; verification and validation; experience reports regarding teaching formal methods; and applications.Chapter “TeSSLa: Temporal Stream-Based Specification Language” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

Author :
Publisher :
ISBN 13 :
Total Pages : 298 pages
Book Rating : 4.90/5 ( download)

DOWNLOAD NOW!

Download or read book Proceedings written by and published by . This book was released on 2002 with total page 298 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Author : Marco Vieira
Publisher : Springer
ISBN 13 : 3642387896
Total Pages : 216 pages
Book Rating : 4.90/5 ( download)

DOWNLOAD NOW!

Download or read book Dependable Computing written by Marco Vieira and published by Springer. This book was released on 2013-11-13 with total page 216 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the thoroughly refereed proceedings of the 14 the European Workshop on Dependable Computing, EWDC 2013, held in Coimbra, Portugal, in May 2013. The 9 full papers and 6 short papers presented were carefully reviewed and selected from 24 submissions. Also included in the volume are 6 fast abstracts presenting work in progress or new ideas in the dependability area. The papers are organized in topical sections on wireless sensor networks; cloud computing and services; testing and fault detection, fault injection and benchmarking and dependable and secure computing.

Author : Zeinab Ganjei
Publisher : Linköping University Electronic Press
ISBN 13 : 9179296971
Total Pages : 192 pages
Book Rating : 4.71/5 ( download)

DOWNLOAD NOW!

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.

Author : Krzysztof R. Apt
Publisher : Springer Science & Business Media
ISBN 13 : 9780387948966
Total Pages : 396 pages
Book Rating : 4.61/5 ( download)

DOWNLOAD NOW!

Download or read book Verification of Sequential and Concurrent Programs written by Krzysztof R. Apt and published by Springer Science & Business Media. This book was released on 1997 with total page 396 pages. Available in PDF, EPUB and Kindle. Book excerpt: Software -- Software Engineering.

Author : Tiziana Margaria
Publisher : Springer
ISBN 13 : 3642340261
Total Pages : 632 pages
Book Rating : 4.60/5 ( download)

DOWNLOAD NOW!

Download or read book Leveraging Applications of Formal Methods, Verification and Validation written by Tiziana Margaria and published by Springer. This book was released on 2012-09-26 with total page 632 pages. Available in PDF, EPUB and Kindle. Book excerpt: The two-volume set LNCS 7609 and 7610 constitutes the thoroughly refereed proceedings of the 5th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, held in Heraklion, Crete, Greece, in October 2012. The two volumes contain papers presented in the topical sections on adaptable and evolving software for eternal systems, approaches for mastering change, runtime verification: the application perspective, model-based testing and model inference, learning techniques for software verification and validation, LearnLib tutorial: from finite automata to register interface programs, RERS grey-box challenge 2012, Linux driver verification, bioscientific data processing and modeling, process and data integration in the networked healthcare, timing constraints: theory meets practice, formal methods for the development and certification of X-by-wire control systems, quantitative modelling and analysis, software aspects of robotic systems, process-oriented geoinformation systems and applications, handling heterogeneity in formal development of HW and SW Systems.