Alagić S., Arbib M.A. — The Design of Well-Structured and Correct Programs :: Электронная библиотека попечительского совета мехмата МГУ

Главная Ex Libris Книги Журналы Статьи Серии Каталог Wanted Загрузка ХудЛит Справка Поиск по индексам Поиск Форум

Авторизация

Поиск по указателям

Alagić S., Arbib M.A. — The Design of Well-Structured and Correct Programs

Alagi&#263 S., Arbib M.A. — The Design of Well-Structured and Correct Programs

Обсудите книгу на научном форуме

Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter

Название: The Design of Well-Structured and Correct Programs

Авторы: Alagić S., Arbib M.A.

Аннотация:

This text synthesizes ten years of research in top-down program design and verification of program correctness. It shows how these techniques may be used in day-to-day programming with the PASCAL language. Many examples of programs and proof development, as well as an explanation of control and data structures, are pro- vided. As a PASCAL programming text, it not only provides a self-contained introduction to the language, but also offers algorithms which operate on sophisticated data structures, and provides the full axiomatic definition of PASCAL in terms of proof rules. Although an introductory course in programmming is required, no particular mathematical background is nec- essary beyond the basic idea of a mathematical proof. A carefully chosen sample of algorithms, including some examples from business data processing, is presented. This collection is supplemented by an extensive set of exercises.

Язык:

Рубрика: Computer science/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1991

Количество страниц: 292

Добавлена в каталог: 13.12.2009

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

Machine language      13—14 256
Manipulating numbers in positional notation      91—95
Manipulating sets      105—110 139—145
Manna, Z.      52 181 216
Mantissa (floating point)      69 256
Map (mapping)      61—62 256
Marmier, E.      52 181
Mathematical induction      191 256
Matrix      78—79
Matrix multiplication      218—219
Matrix, multiplication      218—219
Maximal element of an array      83—89
maxint      71
McCarthy, J.      215
Member      214
membership      59 106 214
Memory, area (of a variable)      72—73 256
Memory, unit      257
Merging arrays      128—134
Merging files      96—97
Merging runs      128—134
Merging, arrays      128—134
Merging, files      96—97
Merging, runs      128—134
MOD      68
Modification of a program      138—139 150—151
Modification of global program structure      116 138—139 150—151
Modularity      116
multidimensional array      78—79
Multiple case labels      33
Multiple precision arithmetic      91—95
Multiple-precision arithmetic      91—95
Multiplication algorithm      41—43 48 53 54 55 112 241—243
Multiplication of numbers in positional notation      93
n-tuple      60 84
Natural merging      128—138
Naur, P.      262
Negation      20—21
Ness, S.      52
Nested blocks      154—158
NIL      201 263
Node      202—203 257
Nontermination      49—52
Normalized floating point representation      69
NOT      262
Null rule      28 38
Null statement      28
Null word      63 257
Number of elements in a set      107
Occurrence of a variable      22—24
Odd      68
Operation      25 —26
Operator precedence      26
OR      262
ord      66—67
Ordered pair      60
Ordinal number      66
output data      57
Output file      102
Overflow      71—72
Palindrome      117—257
PARAMETER      158—163 257
Parameter, list      274
Parametric type definition      162—163
Partial correctness      19 47 257
Partial function      66 257
Partial order      63 257
Partially correct program      19
Partition      173—178 233—235
Partitioning an array (Partition)      173—178
Pascal      10 26 156 158 161 169—170
Pascal expression      24—27
Permutation      64—65
PERMUTE      64
POINTER      201—202 257
Pointer, type      201 271
Pointer, variable      201 271
Portable program      14
positional notation      13 91
Postcondition      17 19 257
Postorder      217
Power set      59—60 106 257
precedence rules      26—27
Pred      66
Predecessor      66 69
Preorder      217
Prime      139—140 257
Prime factorization      243-248
Prime, factorization      243—246 248
Priorities of operators      26—27
Procedure, as a parameter      168—170
Procedure, body      153
Procedure, call      153 155 158 189
Procedure, declaration      152—153 257 270
Procedure, heading      153 270
Procedure, identifier      153 263
Procedure, statement      153 271
Processing, arrays      90—95
Processing, files and records      96—102
Processing, reals      73—75
PROGRAM      178—179 257 277 270
Program, development      115—117 127—139 145—148 193—198 152—153
Program, efficiency      14
Program, heading      178—179 270
Program, parameters      178
Program, specification      17—19 257
Proof of correctness      19 257
Proof rules      27—28 257
Proof rules for assignment statement      28 38 278
Proof rules for blocks      179—180 280—281
Proof rules for case statement      33 38 278
Proof rules for compound statement      29 38 278
Proof rules for conditional statements      30—33 38 278
Proof rules for empty statement      28 38 278
Proof rules for file operators      88—89 280
Proof rules for for statement      82—83 279
Proof rules for functions      165—166 281
Proof rules for goto statement      226—229 230 234 282
Proof rules for procedures      170—172 281—282
Proof rules for programs      179—180 280—281
Proof rules for recursive procedures      190—192
Proof rules for repeat-until statement      36 39 279
Proof rules for sequential composition      29 38 278
Proof rules for simple statements      28 38
Proof rules for while-do statement      34—35 39 279
Proof rules for with statement      87 279
Proofs of correctness of blocks      179—180
Proofs of correctness of functions      165—168
Proofs of correctness of procedures with parameters      171—178
Proofs of correctness of procedures without parameters      170—171
Proofs of correctness of programs      179—180
Proofs of correctness of recursive procedures      190—201
Proving nontermination      49—52
Proving termination      47—49
put      77 89
Quantification      22—23 258
Quantifier symbols      22
Quicksort      199—201
READ      102 104—105
Reading a file      77 88
readln      103
REAL      69
Real continuum      71
Real number      69
Record      76 258
Record with variants      87
Record, section      268
Record, type      268
Record, variable      269
Recursion      186—190 258

Recursive algorithm      187
Recursive algorithms and recursive data structures      212—215
recursive call      189—190
recursive composition      188
Recursive data structure      202—203 210—211
Recursive data types      202—203 210—211
Recursive definition      186—190 262
Recursive function      187 189—190
Recursive procedure      188
Reference      201—202 258
Referenced variable      271
refinement      115—117 152—153
Reflexivity      63—64 258
Relation      63—64 258
Relational operators      21 25 65 264
Relational set operators      106
repeat-until, rule      39
repeat-until, statement      35—36 188 266
Repetitive composition      6 33—37
Repetitive statement      6 33—37 258 266
Representing a large set      151
Reset      77
Resetting a file      77 89
Rest      88
Result type (of a function)      164 271
Return exit      231 234 236 237—238 258
Rewrite      77 89
Rewriting a file      77 89
Ring      209 258
Root      166—168
round      70
Rules of Inference      27—28
S-expression      210—212 258
Scalar type      65—69 258 266
Scale factor      262
Scope of a with statement      86
Scope of identifiers      154—157 179—180 258
Scope of labels      221—222
Searching a list      208
Searching an array      80
Selecting distinct numbers      229—230
Semantic rules      258
Sentence      11
SEQUENCE      76
Sequential composition      29 258
Sequential file      76—78 88—89 258
Serial composition      29 258
Set      58—59 258
Set, expression      105—106 264
Set, manipulation      105—110 139—145
Set, theory      58—65
Set, type      106—258 269
Shift      258
Side effects      160—161 164—165
Sieve of Eratosthenes      139 —145
Similar formulas      23
Simple expressions      25 274 264
simple statement      28 265
simple type      65—71 266 275
Simultaneous substitution      23
Sine function      111
Size of array      161—163
Smallest element of a set      106—107
Smallest prime factor      150—151
Sorted      259
Sorted files      96
Sorting      64
Sorting arrays by merging      127—134
Sorting arrays by natural merging      127—134
Sorting arrays by partitioning      199—201
Sorting arrays by selection      123—127
Sorting arrays by straight merging      149—150
Sorting files by balanced merging      138—139
Sorting files by natural merging      135—139
SQR      68—69
sqrt      69
Squares and palindromes      117—123
Standard functions      68 69
Standard type      65 67—71
State of computation      15—17
Statement      5 259 276 266
Statement, part      154 178—180 271
Static array      79 161—162
Static structure      15
Static variable      201—202 259
Stepwise construction of a solution      193—197
stepwise refinement      115—117
String      263
Structured statement      29—37 259 265
Structured type      58 75—79 84—86 88—89 102—103 105—106 267 259
Subrange type      67 259 266
Subscripting      75—76 79 259
Subset      59 259 106
Subset, relation      64
Substitution      23—24
Subtraction of numbers in positional notation      92—93
Succ      66
Successor      66 69 259
Symmetry      64 259
Syntactic rules      11 259
Tag field      87 211 268
Term      25 273 264
Termination of algorithms      47—52 168 189
Testing      2
Texfiles      102—103 259
text      102
Top-down design      2 115—117 152—153 259
Total correctness      19 47—52 168 189
Total function      259
Towers of Hanoi      218
Transfer function      70
Transitivity      63—64 259
Translating a program      14
Translator      14
Transposition of a matrix      112
TREE      217 259
Tree traversal      217
Trial and error      193
Trial solution      193
TRUE      20
trunc      70
Truth table      21—22 259
TYPE      266
Type definition      66 266
Type identifier      666
Type part      270
Type union      87 211
Type, array      78
Type, Boolean      20—22 65
Type, char      67
Type, file      88
Type, integer      68
Type, real      69—70
Type, record      84—85
Type, scalar      65—69
Type, set      106
Type, simple      65—71
Type, standard      65 67—71
Type, subrange      67
Type, text      102
Ullman, J.D.      149
union      214
Union of sets      214
Universal quantifier      22 259
Unlabelled statement      265
Unpacked structured type      267
unsigned constant      263 272
Unsigned integer      261—262 272
Unsigned number      261 272
Unsigned real      261

1 2 3

О проекте