This book constitutes the refereed proceedings of the International Workshop on Semantics Applications, and Implementation of Program Generation, SAIG 2000, held in Montreal, Canada in September 2000. The seven revised full papers and four position papers presented together with four invited abstracts were carefully reviewed and selected from 20 submissions. Among the topics addressed are multi-stage programming languages, compilation of domain-specific languages and module systems, program transformation, low-level program generation, formal specification, termination analysis, and type-based analysis.

The Formal Semantics of Programming Languages provides the basic mathematical techniques necessary for those who are beginning a study of the semantics and logics of programming languages. These techniques will allow students to invent, formalize, and justify rules with which to reason about a variety of programming languages. Although the treatment is elementary, several of the topics covered are drawn from recent research, including the vital area of concurency. The book contains many exercises ranging from simple to miniprojects.Starting with basic set theory, structural operational semantics is introduced as a way to define the meaning of programming languages along with associated proof techniques. Denotational and axiomatic semantics are illustrated on a simple language of while-programs, and fall proofs are given of the equivalence of the operational and denotational semantics and soundness and relative completeness of the axiomatic semantics. A proof of Godel's incompleteness theorem, which emphasizes the impossibility of achieving a fully complete axiomatic semantics, is included. It is supported by an appendix providing an introduction to the theory of computability based on while-programs. Following a presentation of domain theory, the semantics and methods of proof for several functional languages are treated. The simplest language is that of recursion equations with both call-by-value and call-by-name evaluation. This work is extended to lan guages with higher and recursive types, including a treatment of the eager and lazy lambda-calculi. Throughout, the relationship between denotational and operational semantics is stressed, and the proofs of the correspondence between the operation and denotational semantics are provided. The treatment of recursive types - one of the more advanced parts of the book - relies on the use of information systems to represent domains. The book concludes with a chapter on parallel programming languages, accompanied by a discussion of methods for specifying and verifying nondeterministic and parallel programs.

Program generation holds the promise of helping to bridge the gap between application-level problem solutions and efficient implementations at the level of today's source programs as written in C or Java. Thus, program generation can substantially contribute to reducing production cost and time-to-market in future software production, while improving the quality and stability of the product. This book is about domain-specific program generation; it is the outcome of a Dagstuhl seminar on the topic held in March 2003. After an introductory preface by the volume editors, the 18 carefully reviewed revised full papers presented are organized into topical sections on - surveys of domain-specific programming technologies - domain-specific programming languages - tool support for program generation - domain-specific techniques for program optimization

Real-Time Simulation Technologies: Principles, Methodologies, and Applications is an edited compilation of work that explores fundamental concepts and basic techniques of real-time simulation for complex and diverse systems across a broad spectrum. Useful for both new entrants and experienced experts in the field, this book integrates coverage of detailed theory, acclaimed methodological approaches, entrenched technologies, and high-value applications of real-time simulation—all from the unique perspectives of renowned international contributors. Because it offers an accurate and otherwise unattainable assessment of how a system will behave over a particular time frame, real-time simulation is increasingly critical to the optimization of dynamic processes and adaptive systems in a variety of enterprises. These range in scope from the maintenance of the national power grid, to space exploration, to the development of virtual reality programs and cyber-physical systems. This book outlines how, for these and other undertakings, engineers must assimilate real-time data with computational tools for rapid decision making under uncertainty. Clarifying the central concepts behind real-time simulation tools and techniques, this one-of-a-kind resource: Discusses the state of the art, important challenges, and high-impact developments in simulation technologies Provides a basis for the study of real-time simulation as a fundamental and foundational technology Helps readers develop and refine principles that are applicable across a wide variety of application domains As science moves toward more advanced technologies, unconventional design approaches, and unproven regions of the design space, simulation tools are increasingly critical to successful design and operation of technical systems in a growing number of application domains. This must-have resource presents detailed coverage of real-time simulation for system design, parallel and distributed simulations, industry tools, and a large set of applications.

This book constitutes the refereed proceedings of the Second Symposium on Programs as Data Objects, PADO 2001, held in Aarhus, Denmark, in May 2001. The 14 revised full papers presented were carefully reviewed and selected from 30 submissions. Various aspects of looking at programs as data objects are covered from the point of view of program analysis, program transformation, computational complexity, etc.

This volume contains the 28 papers presented at ESOP 2004, the 13th European Symposium on Programming, which took place in Barcelona, Spain, March 29– 31, 2004. The ESOP series began in 1986 with the goal of bridging the gap between theory and practice, and the conferences continue to be devoted to explaining fundamental issues in the speci?cation, analysis, and implementation of programming languages and systems. The volume begins with a summary of an invited contribution by Peter O’Hearn,titledResources,ConcurrencyandLocalReasoning,andcontinueswith the 27 papers selected by the Program Committee from 118 submissions. Each submission was reviewed by at least three referees, and papers were selected during a ten-day electronic discussion phase. I would like to sincerely thank the members of the Program Committee, as well as their subreferees, for their diligent work; Torben Amtoft, for helping me collect the papers for the proceedings; and Tiziana Margaria, Bernhard Ste?en, and their colleagues at MetaFrame, for the use of their conference management software.

1 The tenth anniversary of the LOPSTR symposium provided the incentive for this volume. LOPSTR started in 1991 as a workshop on logic program synthesis and transformation, but later it broadened its scope to logic-based program development in general, that is, program development in computational logic, and hence the title of this volume. The motivating force behind LOPSTR has been the belief that declarative paradigms such as logic programming are better suited to program development tasks than traditional non-declarative ones such as the imperative paradigm. Speci?cation, synthesis, transformation or specialization, analysis, debugging and veri?cation can all be given logical foundations, thus providing a unifying framework for the whole development process. In the past 10 years or so, such a theoretical framework has indeed begun to emerge. Even tools have been implemented for analysis, veri?cation and speci- ization. However,itisfairtosaythatsofarthefocushaslargelybeenonprogrammi- in-the-small. So the future challenge is to apply or extend these techniques to programming-in-the-large, in order to tackle software engineering in the real world. Returning to this volume, our aim is to present a collection of papers that re?ect signi?cant research e?orts over the past 10 years. These papers cover the wholedevelopmentprocess:speci?cation,synthesis,analysis,transformationand specialization, as well as semantics and systems.

This book constitutes the refereed proceedings of the international symposium Formal Methods Europe, FME 2002, held in Copenhagen, Denmark, in July 2002. The 31 revised full papers presented together with three invited contributions were carefully reviewed and selected from 95 submissions. All current aspects of formal methods are addressed, from foundational and methodological issues to advanced application in various fields.

This book constitutes the refereed proceedings of the 12th European Symposium on Programming, ESOP 2003, held in Warsaw, Poland, in April 2003. The 25 revised full papers presented together with two invited papers were carefully reviewed and selected from 99 submissions. Among the topics addressed are programming paradigms and their integration, program semantics, calculi of computation, security, advanced type systems, program analysis, program transformation, and practical algorithms based on theoretical developments.

The International Symposium on Practical Aspects of Declarative Languages (PADL) is a forum for researchers and practitioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative concepts, especially those emerging from functional, logic, and c- straint languages. Declarative languages have been studied since the inception of computer science, and continue to be a vibrant subject of investigation today due to their applicability in current application domains such as bioinformatics, network con?guration, the Semantic Web, telecommunications software, etc. The 6th PADL Symposium was held in Dallas, Texas on June 18–19, 2004, and was co-located with the Compulog-Americas Summer School on Compu- tional Logic. From the submitted papers, the program committee selected 15 for presentation at the symposium based upon three written reviews for each paper, which were provided by the members of the program committee and additional referees. Two invited talks were presented at the conference. The ?rst was given by Paul Hudak (Yale University) on “An Algebraic Theory of Polymorphic T- poral Media. ” The second invited talk was given by Andrew Fall (Dowlland Technologies and Simon Fraser University) on “Supporting Decisions in C- plex, Uncertain Domains with Declarative Languages. ” Following the precedent set by the previous PADL symposium, the program committee this year again selected one paper to receive the ‘Most Practical - per’award.