Communicating Sequential Processes. The First 25 Years

Communicating Sequential Processes. The First 25 Years

Author: Ali E. Abdallah

Publisher: Springer Science & Business Media

Published: 2005-05-03

Total Pages: 335

ISBN-13: 3540258132

DOWNLOAD EBOOK

This book commemorates the work done by Tony Hoare and published under the title Communicating Sequential Processes in the 1978 August issue of the Communications of ACM. The British Computer Society's specialist group Formal Aspects of Computing Science organized a meeting on July 7-8, 2004, in London, to mark the occasion of 25 years of CSP. The 19 carefully reviewed and revised full papers by leading researchers celebrate, reflect upon, and look beyond the first quarter-century of CSP's contributions to computer science. The papers explore the impact of CSP on many areas ranging from semantics and logic, through the design of parallel programming languages to applications varying from distributed software and parallel computing to information security, Web services, and concurrent hardware circuits.


Parameterized Verification of Synchronized Concurrent Programs

Parameterized Verification of Synchronized Concurrent Programs

Author: Zeinab Ganjei

Publisher: Linköping University Electronic Press

Published: 2021-03-19

Total Pages: 192

ISBN-13: 9179296971

DOWNLOAD EBOOK

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.


Verification, Model Checking, and Abstract Interpretation

Verification, Model Checking, and Abstract Interpretation

Author: Ahmed Bouajjani

Publisher: Springer

Published: 2017-01-09

Total Pages: 575

ISBN-13: 3319522345

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 18th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2017, held in Paris, France, in January 2017. The 27 full papers together with 3 invited keynotes presented were carefully reviewed and selected from 60 submissions. VMCAI provides topics including: program verification, model checking, abstract interpretation and abstract domains, program synthesis, static analysis, type systems, deductive methods, program certification, debugging techniques, program transformation, optimization, hybrid and cyber-physical systems.


Model Checking, Synthesis, and Learning

Model Checking, Synthesis, and Learning

Author: Ernst-Rüdiger Olderog

Publisher: Springer Nature

Published: 2021-12-02

Total Pages: 228

ISBN-13: 3030913848

DOWNLOAD EBOOK

This Festschrift, dedicated to Bengt Jonsson on the occasion of his 60th birthday, contains papers written by many of his friends and collaborators. Bengt has made major contributions covering a wide range of topics including verification and learning. His works on verification, in finite state systems, learning, testing, probabilistic systems, timed systems, and distributed systems reflect both the diversity and the depth of his research. Besides being an excellent scientist, Bengt is also a leader who has greatly influenced the careers of both his students and his colleagues. His main focus throughout his career has been in the area of formal methods, and the research papers dedicated to him in this volume address related topics, particularly related to model checking, temporal logic, and automata learning.


Fourth IFIP International Conference on Theoretical Computer Science - TCS 2006

Fourth IFIP International Conference on Theoretical Computer Science - TCS 2006

Author: Gonzalo Navarro

Publisher: Springer

Published: 2006-12-15

Total Pages: 313

ISBN-13: 0387347356

DOWNLOAD EBOOK

The papers contained in this volume were presented at the fourth edition of the IFIP International Conference on Theoretical Computer Science (IFIP TCS), held August 23-24, 2006 in Santiago, Chile. They were selected from 44 pa pers submitted from 17 countries in response to the call for papers. A total of 16 submissions were accepted as full papers, yielding an acceptance rate of about 36%. Papers sohcited for IFIP TCS 2006 were meant to constitute orig inal contributions in two general areas: Algorithms, Complexity and Models of Computation; and Logic, Semantics, Specification and Verification. The conference also included six invited presentations: Marcelo Arenas (P- tificia Universidad Catolica de Chile, Chile), Jozef Gruska (Masaryk University, Czech Republic), Claudio Gutierrez (Universidad de Chile, Chile), Marcos Kiwi (Universidad de Chile, Chile), Nicola Santoro (Carleton University, Canada), and Mihalis Yannakakis (Columbia University, USA). The abstracts of those presentations are included in this volume. In addition, Jozef Gruska and Nicola Santoro accepted our invitation to write full papers related to their talks. Those two surveys are included in the present volume as well. TCS is a biannual conference. The first edition was held in Sendai (Japan, 2000), followed by Montreal (Canada, 2002) and Toulouse (France, 2004).


Formal Models of Communicating Systems

Formal Models of Communicating Systems

Author: Benedikt Bollig

Publisher: Springer Science & Business Media

Published: 2006-09-08

Total Pages: 183

ISBN-13: 3540329234

DOWNLOAD EBOOK

This book studies the relationship between automata and monadic second-order logic, focusing on classes of automata that describe the concurrent behavior of distributed systems. It provides a unifying theory of communicating automata and their logical properties. Based on Hanf's Theorem and Thomas's graph acceptors, it develops a result that allows characterization of many popular models of distributed computation in terms of the existential fragment of monadic second-order logic.


Application and Theory of Petri Nets and Concurrency

Application and Theory of Petri Nets and Concurrency

Author: Luis Gomes

Publisher: Springer Nature

Published: 2023-05-27

Total Pages: 470

ISBN-13: 3031336208

DOWNLOAD EBOOK

This book constitutes the proceedings of the 44th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2023, which took place in Lisbon, Portugal, in June 2023. The 21 full papers included in this book were carefully reviewed and selected from 47 submissions. They were organized in topical sections as follows: Process mining; semantics; tools; verification; timed models; model transformation. The book also includes two invited talks in full paper length.


Understanding Behaviour of Distributed Systems Using mCRL2

Understanding Behaviour of Distributed Systems Using mCRL2

Author: Muhammad Atif

Publisher: Springer Nature

Published: 2023-02-25

Total Pages: 241

ISBN-13: 3031230086

DOWNLOAD EBOOK

This book helps readers easily learn basic model checking by presenting examples, exercises and case studies. The toolset mCRL2 provides a language to specify the behaviour of distributed systems, in particular where there is concurrency with inter-process communication. This language allows us to analyse a distributed system with respect to its functional requirements. For example, biological cells, supply chain management systems, patient support platforms, and communication protocols. The underlying technique is based on verifying requirements through model checking. The book explains the syntax of mCRL2 and offers modelling tips and tricks.


Mathematical Foundations of Computer Science 2003

Mathematical Foundations of Computer Science 2003

Author: Branislav Rovan

Publisher: Springer

Published: 2003-12-03

Total Pages: 706

ISBN-13: 3540451382

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science, MFCS 2003, held in Bratislava, Slovakia in August 2003. The 55 revised full papers presented together with 7 invited papers were carefully reviewed and selected from 137 submissions. All current aspects in theoretical computer science are addressed, ranging from discrete mathematics, combinatorial optimization, graph theory, networking, algorithms, and complexity to programming theory, formal methods, and mathematical logic.


Formal Techniques for Networked and Distributed Systems - FORTE 2003

Formal Techniques for Networked and Distributed Systems - FORTE 2003

Author: Hartmut König

Publisher: Springer

Published: 2003-11-03

Total Pages: 443

ISBN-13: 3540399798

DOWNLOAD EBOOK

This volume contains the proceedings of FORTE 2003, the 23rd IFIP TC 6/ WG 6.1 International Conference on Formal Techniques for Networked and D- tributed Systems, held in Berlin, Germany, September 29–October 2, 2003. FORTE denotes a series of international working conferences on formal descr- tion techniques (FDTs) applied to computer networks and distributed systems. The conference series started in 1981 under the name PSTV. In 1988 a s- ond series under the name FORTE was set up. Both series were united to FORTE/PSTV in 1996. Two years ago the conference name was changed to its current form. The last ?ve meetings of this long conference series were held in Paris, France (1998), Beijing, China (1999), Pisa, Italy (2000), Cheju Island, Korea (2001), and Houston, USA (2002). The 23rd FORTE conference was especially dedicated to the application of formal description techniques to practice, especially in the Internet and c- munication domain. The scope of the papers presented at FORTE 2003 covered the application of formal techniques, timed automata, FDT-based design, v- i?cation and testing of communication systems and distributed systems, and the veri?cation of security protocols. In addition, work-in-progress papers were presented which have been published in a separate volume.