Helmut Seidl Reihenfolge der Bücher

This book constitutes the refereed proceedings of the 21st European Symposium on Programming, ESOP 2012, held in Tallinn, Estonia, as part of ETAPS 2012, in March/April 2012. The 28 full papers, presented together with one full length invited talk, were carefully reviewed and selected from 92 submissions. Papers were invited on all aspects of programming language research, including: programming paradigms and styles, methods and tools to write and specify programs and languages, methods and tools for reasoning about programs, methods and tools for implementation, and concurrency and distribution.

While compilers for high-level programming languages are large complex software systems, they have particular characteristics that differentiate them from other software systems. Their functionality is almost completely well-defined – ideally there exist complete precise descriptions of the source and target languages, while additional descriptions of the interfaces to the operating system, programming system and programming environment, and to other compilers and libraries are often available. The implementation of application systems directly in machine language is both difficult and error-prone, leading to programs that become obsolete as quickly as the computers for which they were developed. With the development of higher-level machine-independent programming languages came the need to offer compilers that were able to translate programs into machine language. Given this basic challenge, the different subtasks of compilation have been the subject of intensive research since the 1950s. This book is not intended to be a cookbook for compilers, instead the authors' presentation reflects the special characteristics of compiler design, especially the existence of precise specifications of the subtasks.

InhaltsverzeichnisInvited Talk.Formal Foundations for Aspects.Contributed Papers.Sampled Universality of Timed Automata.Iterator Types.Types and Effects for Resource Usage Analysis.The Complexity of Generalized Satisfiability for Linear Temporal Logic.Formalising the ?-Calculus Using Nominal Logic.The Rewriting Calculus as a Combinatory Reduction System.Relational Parametricity and Separation Logic.Model-Checking One-Clock Priced Timed Automata.Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems.Optimal Strategy Synthesis in Stochastic Müller Games.Generalized Parity Games.Tree Automata with Memory, Visibility and Structural Constraints.Enriched ?-Calculi Module Checking.PDL with Intersection and Converse Is 2EXP-Complete.Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems.A Distribution Law for CCS and a New Congruence Result for the ?-Calculus.On the Expressiveness and Complexity of ATL.Polynomial Constraints for Sets with Cardinality Bounds.A Lower Bound on Web Services Composition.Logical Characterizations of Bisimulations for Discrete Probabilistic Systems.Semantic Barbs and Biorthogonality.On the Stability by Union of Reducibility Candidates.An Effective Algorithm for the Membership Problem for Extended Regular Expressions.Complexity Results on Balanced Context-Free Languages.Logical Reasoning for Higher-Order Functions with Local State.