Program analysis concerns static techniques for computing reliable approximate information about the dynamic behaviour of programs. Applications include compilers (for code improvement), software validation (for detecting errors in algorithms or breaches of security) and transformations between data representation (for solving problems such as the Y2K problem). This book is unique in giving an overview of the four major approaches to program analysis: data flow analysis, constraint based analysis, abstract interpretation, and type and effect systems. The presentation demonstrates the extensive similarities between the approaches; this will aid the reader in choosing the right approach and in enhancing it with insights from the other approaches. The book covers basic semantic properties as well as more advanced algorithmic techniques. The book is aimed at M.Sc. and Ph.D. students but will be valuable also for experienced researchers and professionals.

Static analysis allows us to determine aspects of the dynamic behavior of p- grams and systems without actually executing them. Traditionally used in - timizing compilers, static analysis is now also used extensively in veri?cation, software certi?cation and semantics-based manipulation. The research com- nity in static analysis covers a broad spectrum from foundational issues - new semantic models of programming languages and systems - through to practical tools.TheseriesofStatic AnalysisSymposia hasservedasthe primaryvenue for presentation and discussion of theoretical, practical and application advances in the area. This volume contains the papers accepted for presentation at the 12th Int- national Static Analysis Symposium (SAS 2005) which was held 7-9 September 2005 at Imperial College London. A total of 66 papers were submitted; the Program Committee held an online discussion which led to the selection of 22 papers for presentation. The selection was based on scienti?c quality, originality and relevance to the scope of SAS. Every paper was reviewed by at least 3 PC members or external referees. This volume also includes abstracts of talks given by the two invited speakers: Samson Abramsky FRS (University of Oxford) and Andrew Gordon (Microsoft Research, Cambridge). OnbehalfoftheProgramCommittee, theProgramChairwouldliketothank all of the authors who submitted papers and all of the external referees for their careful work in the reviewing process. The Program Chair would also parti- larly like to thank Igor Siveroni who provided local support for the conference management system and who helped in organizing the structure of this volume

This book constitutes the refereed proceedings of the 7th European Symposium on Programming, ESOP'98, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS'98, in Lisbon, Portugal, in March/April 1998.
This volume presents 17 revised full papers selected from a total of 59 submissions; also included is one invited paper. Among the issues addressed are software specification and verification, programming paradigms, semantics for formal development and implementation, program analysis, program transformation, etc.

This book constitutes the refereed proceedings of the First International Conference on Coordination Languages and Models, COORDINATION '96, held in Cesena, Italy in April 1996. Over the last few years, a new class of models, formalisms, and mechanisms for describing concurrent and distributed computations has emerged. A characteristic feature of these coordination languages and models is that they are based on (generative) communication via a shared data space. The 21 revised full papers presented were selected from a total of 78 submissions; also included are three invited papers and 10 posters. All in all, these papers report the state of the art in this young and active area of research and development.

The lambda-calculus lies at the very foundation of computer science. Besides its historical role in computability theory it has had significant influence on programming language design and implementation, denotational semantics and domain theory. The book emphasizes the proof theory for the type-free lambda-calculus. The first six chapters concern this calculus and cover the basic theory, reduction, models, computability, and the relationship between the lambda-calculus and combinatory logic. Chapter 7 presents a variety of typed calculi; first the simply typed lambda-calculus, then Milner-style polymorphism and, finally the polymporphic lambda-calculus. Chapter 8 concerns three variants of the type-free lambda-calculus that have recently appeared in the research literature: the lazy lambda-calculus, the concurrent y-calculus and the lamdba omega-calculus. The final chapter contains references and a guide to further reading. There are exercises throughout. In contrast to earlier books on these topics, which were written by logicians, the book is written from a computer science perspective and emphasizes the practical relevance of many of the key theoretical ideas. The book is intended as a course text for final year undergraduates or first year graduate students in computer science. Research students should find it a useful introduction to more specialist literature.

This Festschrift volume is published in honor of Hanne Riis Nielson and Flemming Nielson on the occasion of their 60th birthdays in 2014 and 2015, respectively. The papers included in this volume deal with the wide area of calculi, semantics, and analysis. The book features contributions from colleagues, who have worked together with Hanne and Flemming through their scientific life and are dedicated to them and to their work. The papers were presented at a colloquium at the Technical University of Denmark in January 2016.

Program analysis utilizes static techniques for computing reliable information about the dynamic behavior of programs. Applications include compilers (for code improvement), software validation (for detecting errors) and transformations between data representation (for solving problems such as Y2K). This book is unique in providing an overview of the four major approaches to program analysis: data flow analysis, constraint-based analysis, abstract interpretation, and type and effect systems. The presentation illustrates the extensive similarities between the approaches, helping readers to choose the best one to utilize.

The lambda-calculus lies at the very foundations of computer science. Besides its historical role in computability theory it has had significant influence on programming language design and implementation, denotational semantics, and domain theory. The book emphasises the proof theory for the type-free lambda-calculus. The first six chapters concern this calculus and cover the basic theory, reduction, models, computability, and the relationship between the lambda-calculus and combinatory logic. Chapter 7 presents a variety of typed calculi; first the simply typed lambda-calculus, then Milner-style polymorphism and, finally, the polymorphic lambda-calculus. Chapter 8 concerns two variants of the type-free lambda-calculus that have appeared in the research literature: the lazy lambda-calculus, and the lambda sigma-calculus. The final chapter contains references and a guide to further reading. There are exercises throughout. In contrast to earlier books on these topics, which were written by logicians, this book is written from a computer science perspective and emphasises the practical relevance of many of the key theoretical ideas. The book is intended as a course text for final year undergraduates or first year graduate students in computer science. Research students should find it a useful introduction to more specialist literature.

O calculo lambda e um dos pilares da ciencia da computacao. Para alem do seu papel historico em teoria da computabilidade, teve influencia significativa no desenho e implementacao de linguagens de programacao, em semantica denotacional, e em teoria de dominios. O livro da enfase a teoria da demonstracao do calculo lambda sem tipos. Os primeiros capitulos concentram-se neste calculo e abordam a teoria basica, reducoes, modelos, computabilidade e o relacionamento entre o calculo lambda e a logica combinatoria. O Capitulo 7 introduz o calculo lambda com tipos: primeiro o calculo lambda simplesmente tipificado, de seguida com o polimorfismo a Milner e, por ultimo, o calculo lambda polimorfico. O Capitulo 9 apresenta versoes mais recentes do calculo lambda sem tipos: o calculo lambda preguicoso e o calculo lambda sigma. O ultimo capitulo contem referencias e um guia para leitura ulterior. Os exercicios vao sendo propostos ao longo do livro. Em contraste com livros anteriores sobre estes topicos, que foram escritos por logicos, este livro e escrito do ponto de vista da ciencia da computacao e realca o significado pratico de muitas das ideias chave. O livro assume-se como livro de texto para o ultimo ano de graduacao ou para o primeiro ano de pos-graduacao em ciencia da computacao. Os estudantes de investigacao poderao usa-lo como uma introducao a literatura mais especializada da area.