Author: P BraffortPublisher:
ISBN:
Category : Computer programming
Languages : en
Pages : 180
Book Description
Computer Programming and Formal Systems
Author: P BraffortPublisher:
ISBN:
Category : Computer programming
Languages : en
Pages : 180
Book Description
Provability, Computability and Reflection
Author: Lev D. BeklemishevPublisher: Elsevier
ISBN: 9780080957463
Category : Mathematics
Languages : en
Pages : 160
Book Description
Provability, Computability and Reflection
Computer Programming and Formal Systems, Edited by P. Braffort and D. Hirschbert
Author: Paul ed BraffortPublisher:
ISBN:
Category : Computer programming
Languages : en
Pages : 161
Book Description
Formal Methods in Computer Science
Author: Jiacun WangPublisher: CRC Press
ISBN: 1498775357
Category : Computers
Languages : en
Pages : 279
Book Description
This textbook gives students a comprehensive introduction to formal methods and their application in software and hardware specification and verification. It has three parts: The first part introduces some fundamentals in formal methods, including set theory, functions, finite state machines, and regular expressions. The second part focuses on logi
Program Verification
Author: Timothy T.R. ColburnPublisher: Springer Science & Business Media
ISBN: 9401117934
Category : Computers
Languages : en
Pages : 454
Book Description
Among the most important problems confronting computer science is that of developing a paradigm appropriate to the discipline. Proponents of formal methods - such as John McCarthy, C.A.R. Hoare, and Edgar Dijkstra - have advanced the position that computing is a mathematical activity and that computer science should model itself after mathematics. Opponents of formal methods - by contrast, suggest that programming is the activity which is fundamental to computer science and that there are important differences that distinguish it from mathematics, which therefore cannot provide a suitable paradigm. Disagreement over the place of formal methods in computer science has recently arisen in the form of renewed interest in the nature and capacity of program verification as a method for establishing the reliability of software systems. A paper that appeared in Communications of the ACM entitled, `Program Verification: The Very Idea', by James H. Fetzer triggered an extended debate that has been discussed in several journals and that has endured for several years, engaging the interest of computer scientists (both theoretical and applied) and of other thinkers from a wide range of backgrounds who want to understand computer science as a domain of inquiry. The editors of this collection have brought together many of the most interesting and important studies that contribute to answering questions about the nature and the limits of computer science. These include early papers advocating the mathematical paradigm by McCarthy, Naur, R. Floyd, and Hoare (in Part I), others that elaborate the paradigm by Hoare, Meyer, Naur, and Scherlis and Scott (in Part II), challenges, limits and alternatives explored by C. Floyd, Smith, Blum, and Naur (in Part III), and recent work focusing on formal verification by DeMillo, Lipton, and Perlis, Fetzer, Cohn, and Colburn (in Part IV). It provides essential resources for further study. This volume will appeal to scientists, philosophers, and laypersons who want to understand the theoretical foundations of computer science and be appropriately positioned to evaluate the scope and limits of the discipline.
Computer programming and formal systems Ed. by P. Braffort, D. Hirschberg
Author: P. BraffortThe Formal Semantics of Programming Languages
Author: Glynn WinskelPublisher: MIT Press
ISBN: 9780262731034
Category : Computers
Languages : en
Pages : 388
Book Description
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.
COMPUTER PROGRAMMING AND FORMAL SYSTEMS- SEMINARS- PAPERS.
Author: Programming Languages and Systems
Author: Wei-Ngan ChinPublisher: Springer Science & Business Media
ISBN: 3540237240
Category : Computers
Languages : en
Pages : 464
Book Description
This book constitutes the refereed proceedings of the Second Asian Symposium on Programming Languages and Systems, APLAS 2004, held in Taipei, Taiwan in November 2004. The 26 revised full papers presented together with abstracts of 3 invited talks were carefully reviewed and selected from 97 submissions. Among the topics covered are type theory, program transformation, static analysis, verification, concurrent systems, code generation, programming calculi, functional programming languages, language support, component systems, real-time systems, embedded systems, formal systems design, object-oriented design, Java objects, program optimization .
Author: P. Braffort