Donald Sannella – författare

Computation, itself a form of calculation, incorporates steps that include arithmetical and non-arithmetical (logical) steps following a specific set of rules (an algorithm).

The 31st International Colloquium on Automata, Languages, and Programming (ICALP 2004) was held from July 12 to July 16 in Turku, Finland. This volume contains all contributed papers presented at ICALP 2004, together with the invitedlecturesbyPhilippeFlajolet(INRIA),RobertHarper(CarnegieMellon), Monika Henzinger (Google), Martin Hofmann (Munich), Alexander Razborov (Princeton and Moscow), Wojciech Rytter (Warsaw and NJIT), and Mihalis Yannakakis (Stanford). ICALP is a series of annual conferences of the European Association for Theoretical Computer Science (EATCS). The ?rst ICALP took place in 1972 and the ICALP program currently consists of track A (focusing on algorithms, automata, complexity, and cryptography) and track B (focusing on databases, logics, semantics, and principles of programming). Inresponsetothecallforpapers,theprogramcommitteereceived379papers, 272 for track A and 107 for track B. This is the highest number of submitted papersinthehistoryofICALPconferences.Theprogramcommitteesselected97 papersforinclusionintothescienti?cprogram.Theprogramcommitteefortrack A met on March 27 and 28 in Barcelona and selected 69 papers from track A.TheprogramcommitteefortrackBselected28papersfromtrackBinthecourse of an electronic discussion lasting for two weeks in the second half of March. The selections were based on originality, quality, and relevance to theor- ical computer science. We wish to thank all authors who submitted extended abstracts for consideration, the program committee for its hard work, and all referees who assisted the program committee in the evaluation process.

The Fifth Workshop on Specification of Abstract Data Types took place 1-4 September 1987 in Gullane, near Edinburgh. This book contains papers based on selected talks presented at the workshop. The algebraic specification of abstract data types has been a flourishing topic in computer science since 1974. The main goal of work in this area is to evolve a methodology to support the design and formal development of reliable software. The particular approach taken builds upon concepts from universal algebra and elementary category theory. The core of this work has now stabilized to a great extent and is mature enough to find application in real-life software engineering and to related topics such as concurrency, databases, and even hardware design. Such applications are becoming more feasible because of the emergence of integrated specification/development environments which include tools such as theorem provers based on fast term rewriting engines. Researchers are also exploring ways of widening the scope of the theory to make it applicable to (for example) higher-order functions and non-deterministic programs. Another trend is toward taking a more general view which allows superficially different approaches having the same general aims and methods to be unified.

Methods for the algebraic specification of abstract data types were proposed in the early 1970s in the USA and Canada and became a major research issue in Europe shortly afterwards. Since then the algebraic approach has come to play a central role in research on formal specification and development, as its range of applications was extended to the specification of complete software systems, to the formal description of the program development process, and to the uniform definition of syntax and semantics of programming languages. Today this approach extends beyond just software to the development of integrated hardware and software systems. These flourishing activities in the area of algebraic specifications have led to an abundance of approaches, theories and concepts, which have universal algebra, category theory and logic as a common mathematical basis. This volume is an annotated bibliography which provides an up-to-date overview of past and present work on algebraic specification. No attempt is made to provide a coherent introduction to the topic for beginners; the intention is rather to provide a guide to the current literature for researchers in algebraic specification and neighboring fields. Some indications of how the different approaches are related are included, together with some ideas concerning possible future directions.

This volume contains the papers selected for presentation at the fifth European Symposium on Programming (ESOP '94), which was held jointly with the 19th Colloquium on Trees in Algebra and Programming (CAAP '94) in Edinburgh in April 1994. ESOP is devoted to fundamental issues in the specification, design and implementation of programming languages and systems. The scope of the symposium includes work on: software analysis, specification, transformation, development and verification/certification; programming paradigms (functional, logic, object-oriented, concurrent, etc.) and their combinations; programming language concepts, implementation techniques and semantics; software design methodologies; typing disciplines and typechecking algorithms; and programming support tools.

This book constitutes the thoroughly refereed post-proceedings of the Second Symposium on Trustworthy Global Computing, TGC 2006, held in Lucca, Italy, in November 2006. The 14 revised papers presented together with two keynote lectures were carefully reviewed and selected from 32 submissions. The book starts off with activity reviews of four FP6 programmes of the European Union: Aeolus, Mobius, Sensoria, and Catnets.

This book provides foundations for software specification and formal software development from the perspective of work on algebraic specification, concentrating on developing basic concepts and studying their fundamental properties.