Download or read book Programs Recursion and Unbounded Choice written by Wim H. Hesselink and published by Cambridge University Press. This book was released on 2005-08-22 with total page 240 pages. Available in PDF, EPUB and Kindle. Book excerpt: Predicate transformation semantics is the best specification method for the development of correct and well-structured computer programs. This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction, and unbounded nondeterminacy. The author develops their theory to a greater depth than has been achieved before, and describes it in a way that makes it readily compatible with programming methodology. He gives proofs of the programming rules for partial and total correctness of repetitions and recursive procedures, supplies new rules for proving incorrectness, and a stronger rule for proving that two programs satisfy the same specifications. Finally, the semantics are extended so that non-terminating programs can be specified as well.
Download or read book Mathematics of Program Construction written by Bernhard Möller and published by Springer Science & Business Media. This book was released on 1995-07-10 with total page 488 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume constitutes the proceedings of the Third International Conference on the Mathematics of Program Construction, held at Kloster Irsee, Germany in July 1995. Besides five invited lectures by distinguished researchers there are presented 19 full revised papers selected from a total of 58 submissions. The general theme is the use of crisp, clear mathematics in the discovery and design of algorithms and in the development of corresponding software and hardware; among the topics addressed are program transformation, program analysis, program verification, as well as convincing case studies.
Download or read book Free Choice Petri Nets written by Jorg Desel and published by Cambridge University Press. This book was released on 1995-01-12 with total page 256 pages. Available in PDF, EPUB and Kindle. Book excerpt: Petri nets are a model for the analysis of concurrent systems.
Download or read book Basic Simple Type Theory written by J. Roger Hindley and published by Cambridge University Press. This book was released on 1997 with total page 200 pages. Available in PDF, EPUB and Kindle. Book excerpt: Type theory is one of the most important tools in the design of higher-level programming languages, such as ML. This book introduces and teaches its techniques by focusing on one particularly neat system and studying it in detail. By concentrating on the principles that make the theory work in practice, the author covers all the key ideas without getting involved in the complications of more advanced systems. This book takes a type-assignment approach to type theory, and the system considered is the simplest polymorphic one. The author covers all the basic ideas, including the system's relation to propositional logic, and gives a careful treatment of the type-checking algorithm that lies at the heart of every such system. Also featured are two other interesting algorithms that until now have been buried in inaccessible technical literature. The mathematical presentation is rigorous but clear, making it the first book at this level that can be used as an introduction to type theory for computer scientists.
Download or read book Concurrency Verification written by W.-P. de Roever and published by Cambridge University Press. This book was released on 2001-11-26 with total page 26 pages. Available in PDF, EPUB and Kindle. Book excerpt: An advanced 2001 textbook on verification of concurrent programs using a semantic approach which highlights concepts clearly.
Download or read book Basic Proof Theory written by A. S. Troelstra and published by Cambridge University Press. This book was released on 2000-07-27 with total page 436 pages. Available in PDF, EPUB and Kindle. Book excerpt: This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included.
Download or read book Unifying Theories of Programming written by Andrew Butterfield and published by Springer Science & Business Media. This book was released on 2010-07-30 with total page 286 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the thoroughly refereed post-proceedings of the Second International Symposium on Unifying Theories of Programming, UTP 2008, held at Trinity College, Dublin, Ireland, in September 2008. The 15 revised full papers presented, together with two invited talks, were carefully reviewed and selected from 20 submissions. Based on the pioneering work on unifying theories of programming of Tony Hoare, He Jifeng, and others, the aims of this Symposium series are to continue to reaffirm the significance of the ongoing UTP project, to encourage efforts to advance it by providing a focus for the sharing of results by those already actively contributing, and to raise awareness of the benefits of such a unifying theoretical framework among the wider computer science and software engineering communities.
Download or read book Derivation and Computation written by H. Simmons and published by Cambridge University Press. This book was released on 2000-05-18 with total page 414 pages. Available in PDF, EPUB and Kindle. Book excerpt: An introduction to simple type theory, containing 200 exercises with complete solutions.
Download or read book Theories of Programming and Formal Methods written by Zhiming Liu and published by Springer. This book was released on 2013-07-24 with total page 422 pages. Available in PDF, EPUB and Kindle. Book excerpt: This Festschrift volume, dedicated to He Jifeng on the occasion of his 70th birthday in September 2013, includes 24 refereed papers by leading researchers, current and former colleagues, who congratulated at a celebratory symposium held in Shanghai, China, in the course of the 10th International Colloquium on Theoretical Aspects of Computing, ICTAC 2013. The papers cover a broad spectrum of subjects, from foundational and theoretical topics to programs and systems issues and to applications, comprising formal methods, software and systems modeling, semantics, laws of programming, specification and verification, as well as logics. He Jifeng is known for his seminal work in the theories of programming and formal methods for software engineering. He is particularly associated with Unifying Theories of Programming (UTP) , the theory of data refinement and the laws of programming, and the rCOS formal method for object and component system construction. His book on UTP with Tony Hoare has been widely read and followed by a large number of researchers, and it has been used in many postgraduate courses. He was a senior researcher at Oxford during 1984-1998, and then a senior research fellow at the United Nations University International Institute for Software Technology (UNU-IIST) in Macau during 1998-2005. He has been a professor and currently the Dean of the Institute of Software Engineering at East China Normal University, Shanghai, China. In 2005, He Jifeng was elected as an academician to the Chinese Academy of Sciences. He also received an honorary doctorate from the University of York. He won a number of prestigious science and technology awards, including a 2nd prize of Natural Science Award from the State Council of China, a 1st prize of Natural Science Award from the Ministry of Education of China, a 1st prize of Technology Innovation from the Ministry of Electronic Industry, and a number awards from Shanghai government.
Download or read book Mathematics of Program Construction written by Johan Jeuring and published by Springer Science & Business Media. This book was released on 1998-05-27 with total page 404 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book consitutes the refereed proceedings of the 4th International Conference on Mathematics of Program Construction, MPC'98, held in Marstrand, near Goteborg, Sweden, in June 1998. The 17 revised full papers presented were selected from 57 submissions; also included are three invited contributions. The volume is devoted to the use of crisp, clear mathematics in the discovery and design of algorithms and in the development of corresponding software and hardware; varoius approaches to formal methods for systems design and analysis are covered.
Download or read book Programming Methodology written by Annabelle Mclver and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 467 pages. Available in PDF, EPUB and Kindle. Book excerpt: Written by the members of the IFIP Working Group 2.3 (Programming Methodology) this text constitutes an exciting reference on the front-line of research activity in programming methodology. The range of subjects reflects the current interests of the members, and will offer insightful and controversial opinions on modern programming methods and practice. The material is arranged in thematic sections, each one introduced by a problem which epitomizes the spirit of that topic. The exemplary problem will encourage vigorous discussion and will form the basis for an introduction/tutorial for its section.
Download or read book Communicating Sequential Processes The First 25 Years written by Ali E. Abdallah and published by Springer Science & Business Media. This book was released on 2005-05-03 with total page 335 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book commemorates the work done by Tony Hoare and published under the title Communicating Sequential Processes in the 1978 August issue of the Communications of ACM. The British Computer Society's specialist group Formal Aspects of Computing Science organized a meeting on July 7-8, 2004, in London, to mark the occasion of 25 years of CSP. The 19 carefully reviewed and revised full papers by leading researchers celebrate, reflect upon, and look beyond the first quarter-century of CSP's contributions to computer science. The papers explore the impact of CSP on many areas ranging from semantics and logic, through the design of parallel programming languages to applications varying from distributed software and parallel computing to information security, Web services, and concurrent hardware circuits.
Download or read book The Optimal Implementation of Functional Programming Languages written by Andrea Asperti and published by Cambridge University Press. This book was released on 1998-12-03 with total page 412 pages. Available in PDF, EPUB and Kindle. Book excerpt: First account of the subject by two of its leading exponents. Essentially self-contained.
Download or read book Refinement Calculus written by Ralph-Johan Back and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 514 pages. Available in PDF, EPUB and Kindle. Book excerpt: Much current research in computer science is concerned with two questions: is a program correct? And how can we improve a correct program preserving correctness? This latter question is known as the refinement of programs and the purpose of this book is to consider these questions in a formal setting. In fact, correctness turns out to be a special case of refinement and so the focus is on refinement. Although a reasonable background knowledge is assumed from mathematics and CS, the book is a self-contained introduction suitable for graduate students and researchers coming to this subject for the first time. There are numerous exercises provided of varying degrees of challenge.
Download or read book Process Algebra Equational Theories of Communicating Processes written by J. C. M. Baeten and published by Cambridge University Press. This book was released on 2010 with total page 477 pages. Available in PDF, EPUB and Kindle. Book excerpt: Presents a unified overview of the various process algebras currently in use and sets the standard for the field.
Download or read book Propositional Logic written by Hans Kleine Büning and published by Cambridge University Press. This book was released on 1999-08-28 with total page 432 pages. Available in PDF, EPUB and Kindle. Book excerpt: This account of propositional logic concentrates on the algorithmic translation of important methods, especially of decision procedures for (subclasses of) propositional logic. Important classical results and a series of new results taken from the fields of normal forms, satisfiability and deduction methods are arranged in a uniform and complete theoretic framework. The algorithms presented can be applied to VLSI design, deductive databases and other areas. After introducing the subject the authors discuss satisfiability problems and satisfiability algorithms with complexity considerations, the resolution calculus with different refinements, and special features and procedures for Horn formulas. Then, a selection of further calculi and some results on the complexity of proof procedures are presented. The last chapter is devoted to quantified boolean formulas. The algorithmic approach will make this book attractive to computer scientists and graduate students in areas such as automated reasoning, logic programming, complexity theory and pure and applied logic.
Download or read book Foundations of Component Based Systems written by Gary T. Leavens and published by Cambridge University Press. This book was released on 2000-03-28 with total page 326 pages. Available in PDF, EPUB and Kindle. Book excerpt: Articles, originally published in 2000, by experts including theoretical frameworks and models plus case studies and findings.