You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Why would you read this preface? As we start thinking what to write here, we wonder who is going to read these words. Fromourperspective–thatofwritersaddressinganaudienceofreaders–you are most likely Willem-Paul de Roever. Willem: our main motivation in putting together this Festschrift is to honor you on the occasion of your retirement. In terms of scienti?c ancestry, you are a father to two of us, and a grandfather to 1 the third , and you have had a profound impact on our formation as computer scientists.Atthepersonallevel,weknowyouasakind-hearted,generousperson. We are grateful to know you in these ways, and hope to have encounters with you in many years to come. Anotherlikelypossibi...
This book presents revised tutorial lectures given by invited speakers at the First International Symposium on Formal Methods for Components and Objects, FMCO 2002, held in Leiden, The Netherlands, in November 2002. The 21 revised lectures by leading researchers present a comprehensive account of the potential of formal methods applied to complex software systems such as components and object systems. The book makes a unique contribution to bridging the gap between theory and practice in software engineering.
An advanced 2001 textbook on verification of concurrent programs using a semantic approach which highlights concepts clearly.
This book constitutes the refereed proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, FTRTFT 2000, held in Pune, India in September 2000. The 21 revised full papers presented together with three invited contributions were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on model checking, fault tolerance, scheduling, validation, verification, logic and automata.
The goal of this book is to provide a comprehensive and systematic introduction to the important and highly applicable method of data refinement and the simulation methods used for proving its correctness. The authors concentrate in the first part on the general principles needed to prove data refinement correct. They begin with an explanation of the fundamental notions, showing that data refinement proofs reduce to proving simulation. The book's second part contains a detailed survey of important methods in this field, which are carefully analysed, and shown to be either incomplete, with counterexamples to their application, or to be always applicable whenever data refinement holds. This is shown by proving, for the first time, that all these methods can be described and analysed in terms of two simple notions: forward and backward simulation. The book is self-contained, going from advanced undergraduate level and taking the reader to the state of the art in methods for proving simulation.
Particularly in the humanities and social sciences, festschrifts are a popular forum for discussion. The IJBF provides quick and easy general access to these important resources for scholars and students. The festschrifts are located in state and regional libraries and their bibliographic details are recorded. Since 1983, more than 639,000 articles from more than 29,500 festschrifts, published between 1977 and 2010, have been catalogued.
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 conclus...
Formal methods are coming of age. Mathematical techniques and tools are now regarded as an important part of the development process in a wide range of industrial and governmental organisations. A transfer of technology into the mainstream of systems development is slowly, but surely, taking place. FM’99, the First World Congress on Formal Methods in the Development of Computing Systems, is a result, and a measure, of this new-found maturity. It brings an impressive array of industrial and applications-oriented papers that show how formal methods have been used to tackle real problems. These proceedings are a record of the technical symposium ofFM’99:alo- side the papers describingapplic...
Security is a rapidly growing area of computer science, with direct and increasing relevance to real-life applications, such as Internet transactions, e-commerce, information protection, network and systems security, etc. Foundations for the analysis and design of security features of such applications are badly needed in order to validate and prove their correctness. This book presents thoroughly revised versions of six tutorial lectures given by leading researchers during two International Schools on Foundations of Security Analysis and Design, FOSAD 2001/2002, held in Bertinoro, Italy, in September 2001 and September 2002. The lectures are devoted to: - Formal Approaches to Approximating Noninterference Properties - The Key Establishment Problem - Name-Passing Calculi and Cryptoprimitives - Classification of Security Properties; Network Security - Cryptographic Algorithms for Multimedia Traffic - Security for Mobility
ECOOP'99 Workshops, Panels, and Posters Lisbon, Portugal, June 14-18, 1999 Proceedings