Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
Catalogue Display
Catalogue Display
The Evolution of Programs
.
Bookmark this Record
Catalogue Record 46789
.
.
Author info on Wikipedia
.
.
LibraryThing
.
.
Google Books
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 46789
.
Reviews
Catalogue Record 46789
.
British Library
Resolver for RSN-46789
Google Scholar
Resolver for RSN-46789
WorldCat
Resolver for RSN-46789
Catalogo Nazionale SBN
Resolver for RSN-46789
GoogleBooks
Resolver for RSN-46789
ICTP Library
Resolver for RSN-46789
.
Share Link
Jump to link
Catalogue Information
Field name
Details
Dewey Class
004
Title
The Evolution of Programs ([EBook] /) / by Nachum Dershowitz.
Author
Dershowitz, Nachum
Other name(s)
SpringerLink (Online service)
Publication
Boston, MA : : Birkhäuser Boston : : Imprint: Birkhäuser, , 1983.
Physical Details
V, 359 p. : online resource.
Series
Progress in Computer Science No.5
; 5
ISBN
9781461256212
Summary Note
-Ecclesiastes 12:12 Programs are invariably subjected to many rorms or transrormation. After an initial version of a program has been designed and developed, it undergoes debugging and certification. In addition, most long-lived pro grams have a liCe-cycle that includes modifications to meet amended specifications and extensions for expanded capabilities. Such evolution ary aspects of programming are the topic of this monograph. We present rormal methods for manipulating programs and illustrate their applica tion with numerous examples. Such methods could be incorporated in semi-automated programming environments, where they would serve to ease the burden on the programmer. We begin by describing a method whereby a given program that achieves one goal can be modified to achieve a different goal or a pro gram that computes wrong results can be debugged to achieve the 2 Preface intended results. The abstraction of a set of cognate programs to obtain a program schema, and the instantiation of abstract schemata to solve concrete problems, are approached from the same perspective. In addition, we describe synthesis rules for generating code from specifications and annotation rules for making assertions about code. The synthesis rules may be used when a program is first being developed, or when, in the course of modifying a program, the need arises to rewrite a program segment. Annotation rules may be used for the purpose of determining what an incorrect program really does before attempting to debug it or how a correct program works before attempting to modify it.:
Contents note
1. Introduction -- 2. General Overview -- 2.1. Introduction -- 2.2. The Problem -- 2.3. Annotation -- 2.4. Debugging -- 2.5. Modification -- 2.6. Abstraction -- 2.7. Instantiation -- 2.8. Synthesis -- 2.9. Discussion -- 3. Program Modification and Debugging -- 3.1. Introduction -- 3.2. Overview -- 3.3. Examples -- 3.4. Discussion -- 4. Program Abstraction and Instantiation -- 4.1. Introduction -- 4.2. Overview -- 4.3. Examples -- 4.4. Discussion -- 5. Program Synthesis and Extension -- 5.1. Introduction -- 5.2. Overview -- 5.3. Examples -- 5.4. Discussion -- 6. Program Annotation and Analysis -- 6.1. Introduction -- 6.2. Overview -- 6.3. Examples -- 6.4. Discussion -- 7. General Discussion -- Appendix 1: Global Transformations -- Appendix 2: Program Schemata -- Appendix 3: Synthesis Rules -- Appendix 4: Annotation Rules -- 4.1. Assignment Rules -- 4.1.1. Range Rules -- 4.1.2. Set Assignment Rules -- 4.1.3. Counter Relation Rules -- 4.1.4. Basic Relation Rules -- 4.1.5. Assorted Relation Rules -- 4.2. Control Rules -- 4.2.1. Control Axioms -- 4.2.2. Assignment Control Rules -- 4.2.3. Conditional Control Rules -- 4.2.4. Loop Control Rules -- 4.2.5. Value Rules -- 4.3. Heuristic Rules -- 4.3.1. Control Heuristics -- 4.3.2. Dangerous Heuristics -- Appendix 5: Implementation -- 5.1. Introduction -- 5.2. Modification -- 5.3. Synthesis -- 5.4. Annotation -- References -- Name Index.
System details note
Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site
http://dx.doi.org/10.1007/978-1-4612-5621-2
Links to Related Works
Subject References:
Computer Science
.
Computer Science, general
.
Computers
.
History
.
History of Computing
.
History of Science
.
Mathematics of Computing
.
Theory of Computation
.
Authors:
Dershowitz, Nachum
.
Corporate Authors:
SpringerLink (Online service)
.
Series:
Progress in Computer Science No.5
.
Classification:
004
.
.
ISBD Display
Catalogue Record 46789
.
Tag Display
Catalogue Record 46789
.
Related Works
Catalogue Record 46789
.
Marc XML
Catalogue Record 46789
.
Add Title to Basket
Catalogue Record 46789
.
Catalogue Information 46789
Beginning of record
.
Catalogue Information 46789
Top of page
.
Download Title
Catalogue Record 46789
Export
This Record
As
Labelled Format
Bibliographic Format
ISBD Format
MARC Format
MARC Binary Format
MARCXML Format
User-Defined Format:
Title
Author
Series
Publication Details
Subject
To
File
Email
Reviews
This item has not been rated.
Add a Review and/or Rating
46789
1
46789
-
2
46789
-
3
46789
-
4
46789
-
5
46789
-
Quick Search
Search for