Concurrency Security And Puzzles

This festschrift was written in honor of Andrew William (Bill) Roscoe on the occasion of his 60th birthday, and features tributes by Sir Tony Hoare, Stephen Brookes, and Michael Wooldridge. Bill Roscoe is an international authority in process algebra, and has been the driving force behind the development of the FDR refinement checker for CSP. He is also world renowned for his pioneering work in analyzing security protocols, modeling information flow, human-interactive security, and much more. Many of these areas are reflected in the 15 invited research articles in this festschrift, and in the presentations at the "BILL-60" symposium held in Oxford, UK, on January 9 and 10, 2017.

This book constitutes the proceedings of the 9th International Conference on Security and Cryptography, SCN 2014, held in Amalfi, Italy, in September 2014. The 31 papers presented in this volume were carefully reviewed and selected from 95 submissions. They are organized in topical sections on key exchange; multilinear maps and obfuscation; pseudorandom function extensions; secure computation - foundations and algorithms; network security; functional encryption; cryptanalysis; secure computation - implementation; zero knowledge; message authentication; proofs of space and erasure; public-key encryption.

This book constitutes the proceedings of the 39th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems, FORTE 2019, held in Copenhagen, Denmark, in June 2019, as part of the 14th International Federated Conference on Distributed Computing Techniques, DisCoTec 2019. The 15 full and 3 short papers presented were carefully reviewed and selected from 42 submissions. The conference is dedicated to fundamental research on theory, models, tools, and applications for distributed systems.

This book constitutes the proceedings of the 8th International Symposium on Dependable Software Engineering, SETTA 2022, held in Beijing, China, in October 2022. The 11 full papers and 3 short papers in this volume were carefully reviewed and selected from 29 submissions, and are presented with 3 abstracts of keynote speeches. They deal with latest research results and ideas on bridging the gap between formal methods and software engineering.

This book constitutes the refereed proceedings of the 19th International Conference on Software Engineering and Formal Methods, SEFM 2021, held as a virtual event, in December 2021. The 22 full papers presented together with 4 short papers were carefully reviewed and selected from 86 submissions. Also included are 2 invited talks and an abstract of a keynote talk. The papers cover a large variety of topics, including testing, formal verification, program analysis, runtime verification, meta-programming and software development and evolution. Chapter 'Configuration Space Exploration for Digital Printing Systems' is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

The open access two-volume set LNCS 12224 and 12225 constitutes the refereed proceedings of the 32st International Conference on Computer Aided Verification, CAV 2020, held in Los Angeles, CA, USA, in July 2020.* The 43 full papers presented together with 18 tool papers and 4 case studies, were carefully reviewed and selected from 240 submissions. The papers were organized in the following topical sections: Part I: AI verification; blockchain and Security; Concurrency; hardware verification and decision procedures; and hybrid and dynamic systems. Part II: model checking; software verification; stochastic systems; and synthesis. *The conference was held virtually due to the COVID-19 pandemic.

This book constitutes the refereed proceedings of the 11th International Workshop on Reachability Problems, RP 2017, held in London, UK, in September 2017. The 12 full papers presented together with 1 invited paper were carefully reviewed and selected from 17 submissions. The aim of the conference is to bring together scholars from diverse fields with a shared interest in reachability problems, and to promote the exploration of new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques. Topics of interest include (but are not limited to): reachability for innite state systems; rewriting systems; reachability analysis in counter/timed/cellular/communicating automata; Petri nets; computational aspects of semigroups, groups, and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps, and new computational paradigms.