You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This book introduces a process calculus for parallel, distributed and reactive systems. It describes the conceptual foundations as well as the mathematical theory behind a programming language, and a number of application examples. The chosen approach provides a framework for understanding the semantics of parallel and distributed systems. Moreover, it can be directly applied to practical problems.
Language prototyping provides a means to generate language implementations automatically from high-level language definitions. This volume presents an algebraic specification approach to language prototyping, and is centered around the ASF+SDF formalism and Meta-Environment. The volume is an integrated collection of articles covering a number of case studies, and includes several chapters proposing new techniques for deriving advanced language implementations. The accompanying software is freely available.
This volume of the Lecture Notes in Computer Science series contains the papers accepted for presentation at the Second International Conference on Autonomous Infrastructure, Management and Security (AIMS 2008). The conference took place in Bremen, Germany, hosted by the Jacobs University Bremen. AIMS 2008 was - ganized and supported by the EC IST-EMANICS Network of Excellence (#26854) in cooperation with ACM SIGAPP and ACM SIGMIS and co-sponsored by IFIP WG 6.6 and Jacobs University Bremen. This year’s AIMS 2008 constituted the second edition of a single-track and standalone conference on management and security aspects of distributed and autonomous systems, which took place initially in ...
While there are many surveys of cryptography, none pay any attention to the volume of manuals that appeared during the seventeenth century, or provide any cultural context for the appearance, design, or significance of the genre during the period.Through close readings of five specific primary texts that have been ignored not only in cryptography scholarship but also in early modern literary, scientific, and historical studies, this book allows us to see one origin of disciplinary division in the popular imagination and in the university, when particular broad fields – the sciences, the mechanical arts, and the liberal arts – came to be viewed as more or less profitable.
This book constitutes the refereed proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science, MFCS '96, held in Crakow, Poland in September 1996. The volume presents 35 revised full papers selected from a total of 95 submissions together with 8 invited papers and 2 abstracts of invited talks. The papers included cover issues from the whole area of theoretical computer science, with a certain emphasis on mathematical and logical foundations. The 10 invited presentations are of particular value.
CASL, the Common Algebraic Specification Language, was designed by the members of CoFI, the Common Framework Initiative for algebraic specification and development, and is a general-purpose language for practical use in software development for specifying both requirements and design. CASL is already regarded as a de facto standard, and various sublanguages and extensions are available for specific tasks. This reference manual presents a detailed documentation of the CASL specification formalism. It reviews the main underlying concepts, and carefully summarizes the intended meaning of each construct of CASL. The book formally defines both the syntax and semantics of CASL, and presents a logic for reasoning about CASL specifications. Furthermore, extensive libraries of CASL specifications of basic data types are provided as well as a comprehensive annotated bibliography of CoFI publications. As a separate, complementary book LNCS 2900 presents a tutorial introduction to CASL, the CASL User Manual.
This book constitutes the refereed proceedings of the Second International Conference on Computability in Europe, CiE 2006, held in Swansea, UK, June/July 2006. The book presents 31 revised full papers together with 30 invited papers, including papers corresponding to 8 plenary talks and 6 special sessions on proofs and computation, computable analysis, challenges in complexity, foundations of programming, mathematical models of computers and hypercomputers, and Gödel centenary: Gödel's legacy for computability.
Term rewriting systems developed out of mathematical logic and are an important part of theoretical computer science. They consist of sequences of discrete transformation steps where one term is replaced with another and have applications in many areas, from functional programming to automatic theorem proving and computer algebra. This 2003 book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appeared here for the first time in book form. Subjects treated include orthogonality, termination, completion, lambda calculus, higher-order rewriting, infinitary rewriting and term graph rewriting. Many exercises are included with selected solutions provided on the web. A comprehensive bibliography makes this book ideal both for teaching and research. A chapter is included presenting applications of term rewriting systems, with many pointers to actual implementations.
There is algebraic structure in time, computation and biological systems. Algebraic engineering exploits this structure to achieve better understanding and design. In this book, pure and applied results in semigroups, language theory and algebra are applied to areas ranging from circuit design to software engineering to biological evolution.