New Methods of Concurrent Checking

New Methods of Concurrent Checking PDF Author: Michael Gössel
Publisher: Springer Science & Business Media
ISBN: 140208420X
Category : Technology & Engineering
Languages : en
Pages : 186

Get Book Here

Book Description
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.

New Methods of Concurrent Checking

New Methods of Concurrent Checking PDF Author: Michael Gössel
Publisher: Springer Science & Business Media
ISBN: 140208420X
Category : Technology & Engineering
Languages : en
Pages : 186

Get Book Here

Book Description
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.

New Methods of Concurrent Checking

New Methods of Concurrent Checking PDF Author: Michael Gössel
Publisher: Springer
ISBN: 9789048117536
Category : Technology & Engineering
Languages : en
Pages : 182

Get Book Here

Book Description
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.

Model Checking and Artificial Intelligence

Model Checking and Artificial Intelligence PDF Author: Stefan Edelkamp
Publisher: Springer Science & Business Media
ISBN: 3540741275
Category : Computers
Languages : en
Pages : 193

Get Book Here

Book Description
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.

Verification of Sequential and Concurrent Programs

Verification of Sequential and Concurrent Programs PDF Author: Krzysztof R. Apt
Publisher: Springer Science & Business Media
ISBN: 9780387948966
Category : Computers
Languages : en
Pages : 396

Get Book Here

Book Description
Software -- Software Engineering.

Formal Methods: Foundations and Applications

Formal Methods: Foundations and Applications PDF Author: Tiago Massoni
Publisher: Springer
ISBN: 303003044X
Category : Computers
Languages : en
Pages : 281

Get Book Here

Book Description
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.

Proceedings

Proceedings PDF Author:
Publisher:
ISBN:
Category : Electronic circuit design
Languages : en
Pages : 298

Get Book Here

Book Description


Dependable Computing

Dependable Computing PDF Author: Marco Vieira
Publisher: Springer
ISBN: 3642387896
Category : Computers
Languages : en
Pages : 216

Get Book Here

Book Description
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.

Parameterized Verification of Synchronized Concurrent Programs

Parameterized Verification of Synchronized Concurrent Programs PDF Author: Zeinab Ganjei
Publisher: Linköping University Electronic Press
ISBN: 9179296971
Category :
Languages : en
Pages : 192

Get Book Here

Book Description
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.

Leveraging Applications of Formal Methods, Verification and Validation

Leveraging Applications of Formal Methods, Verification and Validation PDF Author: Tiziana Margaria
Publisher: Springer
ISBN: 3642340261
Category : Computers
Languages : en
Pages : 632

Get Book Here

Book Description
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.

Model Checking Software

Model Checking Software PDF Author: Ezio Bartocci
Publisher: Springer
ISBN: 3642391761
Category : Computers
Languages : en
Pages : 386

Get Book Here

Book Description
This book constitutes the refereed proceedings of the 20th International Symposium on Model Checking Software, SPIN 2013, held in Stony Brook, NY, USA, in July 2013. The 18 regular papers, 2 tool demonstration papers, and 2 invited papers were carefully reviewed and selected from 40 submissions. The traditional focus of SPIN has been on explicit-state model checking techniques, as implemented in SPIN and other related tools. While such techniques are still of key interest to the workshop, its scope has broadened over recent years to include techniques for the verification and formal testing of software systems in general.