| Description |
1 online resource (ix, 351 pages) : illustrations |
| Series |
EATCS monographs on theoretical computer science ; v. 24 |
|
EATCS monographs on theoretical computer science ; v. 24.
|
| Contents |
Mathematical Background -- 1. Logic and Model Theory -- 2. Inductive Definability -- I Computability -- 3. Introduction to Part I -- 4. Main Properties of Program Schemas -- 5. Extension of Program Schemas -- 6. Program Schemas with Stacks -- 7. Computability -- 8. On Inductive Definability of 1- and 2-Computable Relations -- II Extended Dynamic Logics -- 9. Introduction to Part II -- 10. Description of Program Properties -- 11. Den-based Descriptive Languages -- 12. The Problem of Completeness -- 13. Dynamic Logic Generated by Extension -- 14. Continuous Denotational Semantics -- 15. Definable Denotational Semantics -- III Temporal Characterization of Programs -- 16. Introduction to Part III -- 17. Temporal Logic -- 18. Temporal Logical Description of Program Properties -- 19. Is Temporal Logic Expressible in Dynamic Logic? -- 20. Is Dynamic Logic Expressible in Temporal Logic? -- 21. The Case of Enumerable Models -- 22. Temporal Axiomatization of Program Verification Methods -- IV Programming Logic with Explicit Time -- 23. Introduction to Part IV -- 24. Time Logic -- 25. Definability in Regular Time Theories -- 26. Expressive Power of Time -- Epilogue -- References -- Notations |
| Summary |
This book proposes a purely classical first-order logical approach to the theory of programming. The authors, leading members of the famous "Hungarian school", use this approach to give a unified and systematic presentation of the theory. This approach provides formal methods and tools for reasoning about computer programs and programming languages by allowing the syntactic and semantic characterization of programs, the description of program properties, and ways to check whether a given program satisfies certain properties. The basic methods are logical extension, inductive definition and their combination, all of which admit an appropriate first-order representation of data and time. The framework proposed by the authors allows the investigation and development of different programming theories and logics from a unified point of view. Dynamic and temporal logics, for example, are investigated and compared with respect to their expressive and proof-theoretic powers. The book should appeal to both theoretical researchers and students. For researchers in computer science the book provides a coherent presentation of a new approach which permits the solution of various problems in programming theory in a unified manner by the use of first-order logical tools. The book may serve as a basis for graduate courses in programming theory and logic as it covers all important questions arising between the theory of computation and formal descriptive languages and presents an appropriate derivation system |
| Analysis |
Computer programming |
|
psychologie |
|
psychology |
|
psychiatrie |
|
psychiatry |
|
neurowetenschap |
|
neuroscience |
|
Psychology (General) |
|
Psychologie (algemeen) |
| Bibliography |
Includes bibliographical references (pages 335-340) and index |
| Notes |
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212 MiAaHDL |
|
digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL |
|
Print version record |
| Subject |
Computer programming.
|
|
computer programming.
|
|
Computer programming
|
|
Programmierung
|
|
Prädikatenlogik
|
|
Stufe 1
|
|
Logica e semantica de programacao.
|
|
Ordinateurs -- Programmation.
|
| Form |
Electronic book
|
| Author |
Úry, László, 1953-
|
| ISBN |
9783642582059 |
|
3642582052 |
|
9783642635038 |
|
3642635032 |
|
