This book constitutes the refereed proceedings of the 25th European Conference on Object-Oriented Programming, ECOOP 2011, held in Lancaster, UK, in July 2011. The 26 revised full papers, presented together with three keynote lectures were carefully reviewed and selected from a total of 100 submissions. The papers cover topics such as empirical studies, mining, understanding, recommending, modularity, modelling and refactoring, aliasing and ownership; as well as memory optimizations.

Annotation This book constitutes the refereed proceedings of the 24th European Conference on Object-Oriented Programming, ECOOP 2010, held in Maribor, Slovenia, in June 2010. The 24 revised full papers, presented together with one extended abstract were carefully reviewed and selected from a total of 108 submissions. The papers cover topics such as programming environments and tools, theoretical foundations of programming languages, formal methods, concurrency models in Java, empirical methods, type systems, language design and implementation, concurrency abstractions and experiences.

This book presents a survey of the state-of-the-art on techniques for dealing with aliasing in object-oriented programming. It marks the 20th anniversary of the paper The Geneva Convention On The Treatment of Object Aliasing by John Hogg, Doug Lea, Alan Wills, Dennis de Champeaux and Richard Holt. The 22 revised papers were carefully reviewed to ensure the highest quality.The contributions are organized in topical sections on the Geneva convention, ownership, concurrency, alias analysis, controlling effects, verification, programming languages, and visions.

This Festschrift volume includes a collection of papers written in honor of the accomplishments of Professor Yonezawa on the occasion of his 65th birthday in 2012. With a few exceptions, the papers in this Festschrift were presented at an international symposium celebrating this occasion. Also included are reprints of two of Professor Yonezawa's most influential papers on the programming language ABCL. The volume is a testament strong and lasting impact Professor Yonezawa's research accomplishments as well as the inspiration he has been to colleagues and students alike.

With 11 invited submissions from leading researchers and teams of researchers sharing one common characteristic ? all have worked with Dr. Judith Bishop during her long and continuing career as a leader in computer science education and research ? this book reflects on Dr Bishop?s outstanding contribution to computer science. Having worked at three different universities she now holds a leadership position in the research division of a major software company. The topics covered reflect some of the transitions in her career. The dominant theme is programming languages, with chapters on object oriented programming, real-time programming, component programming and design patterns. Another major and related topic is compilers, with contributions on dataflow analysis, tree rewriting and keyword recognition. Finally, there are some additional chapters on other varied but highly interesting topics including smart homes, mobile systems and teaching computer science.

This open access book constitutes the proceedings of the 31st European Symposium on Programming, ESOP 2022, which was held during April 5-7, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 21 regular papers presented in this volume were carefully reviewed and selected from 64 submissions. They deal with fundamental issues in the specification, design, analysis, and implementation of programming languages and systems.

A comprehensive introduction to type systems and programming languages. A type system is a syntactic method for automatically checking the absence of certain erroneous behaviors by classifying program phrases according to the kinds of values they compute. The study of type systems—and of programming languages from a type-theoretic perspective—has important applications in software engineering, language design, high-performance compilers, and security. This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages. The approach is pragmatic and operational; each new concept is motivated by programming examples and the more theoretical sections are driven by the needs of implementations. Each chapter is accompanied by numerous exercises and solutions, as well as a running implementation, available via the Web. Dependencies between chapters are explicitly identified, allowing readers to choose a variety of paths through the material. The core topics include the untyped lambda-calculus, simple type systems, type reconstruction, universal and existential polymorphism, subtyping, bounded quantification, recursive types, kinds, and type operators. Extended case studies develop a variety of approaches to modeling the features of object-oriented languages.

This book presents the thoroughly refereed post-conference proceedings of the International Conference on Formal Verification of Object-Oriented Software, FoVeOOS 2011, held in Turin, Italy, in October 2011 – organised by COST Action IC0701. The 10 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 19 submissions. Formal software verification has outgrown the area of academic case studies, and industry is showing serious interest. The logical next goal is the verification of industrial software products. Most programming languages used in industrial practice are object-oriented, e.g. Java, C++, or C#. FoVeOOS 2011 aimed to foster collaboration and interactions among researchers in this area.

Search structures support the fundamental data storage primitives on key-value pairs: insert a pair, delete by key, search by key, and update the value associated with a key. Concurrent search structures are parallel algorithms to speed access to search structures on multicore and distributed servers. These sophisticated algorithms perform fine-grained synchronization between threads, making them notoriously difficult to design correctly. Indeed, bugs have been found both in actual implementations and in the designs proposed by experts in peer-reviewed publications. The rapid development and deployment of these concurrent algorithms has resulted in a rift between the algorithms that can be verified by the state-of-the-art techniques and those being developed and used today. The goal of this book is to show how to bridge this gap in order to bring the certified safety of formal verification to high-performance concurrent search structures. Similar techniques and frameworks can be applied to concurrent graph and network algorithms beyond search structures.

The core idea of this book is that object– oriented technology is a generic technology whose various technical aspects can be presented in a unified and consistent framework. This applies to both practical and formal aspects of object-oriented technology. Course tested in a variety of object-oriented courses, numerous examples, figures and exercises are presented in each chapter. The approach in this book is based on typed technologies, and the core notions fit mainstream object-oriented languages such as Java and C#. The book promotes object-oriented constraints (assertions), their specification and verification. Object-oriented constraints apply to specification and verification of object-oriented programs, specification of the object-oriented platform, more advanced concurrent models, database integrity constraints and object-oriented transactions, their specification and verification.