Theoretical foundations of programming methodology : lecture notes of an international summer school, directed by F.L. Bauer, E.W. Dijkstra and C.A.R. Hoare
著者
書誌事項
Theoretical foundations of programming methodology : lecture notes of an international summer school, directed by F.L. Bauer, E.W. Dijkstra and C.A.R. Hoare
(NATO advanced study institutes series, ser. C . Mathematical and physical sciences ; v. 91)
D. Reidel, c1982
大学図書館所蔵 全24件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Papers presented in 1981 at the Marktoberdorf Summer School on Theoretical Foundations of Programming Methodology, organized under the auspices of the Technical University Munich and sponsored by the NATO Science Committee under the 1981 advanced study institutes program
"Published in cooperation with NATO Scientific Affairs Division."
Includes bibliographies
内容説明・目次
- 巻冊次
-
ISBN 9789027714602
内容説明
Papers presented at the Marktoberdorf Summer School on Theoretical Foundations of Programming Methodology, organized under the auspices of the Technical University Munich and sponsored by the NATO Scientific Affairs Division, Germany, 1981
目次
I: Program Development and Verification.- Smoothsort, an Alternative for Sorting in Situ.- Lambek and Moser Revisited.- A General Axiom of Assignment.- Assignment and Linked Data Structures.- A Proof of the Schorr-Waite Algorithm.- Verification of Sequential Programs: Temporal Axiomatization.- Specification and Derivation of Programs.- Repaying Our Debts.- II: Denotational Semantics.- Lectures on a Mathematical Theory of Computation.- Semantic Models.- III: Abstract Data Types.- Algebras, Theories and Freeness: An Introduction for Computer Scientists.- An Analysis of Semantic Models for Algebraic Specifications.- IV: Infinite Structures.- Fundamental Properties of Infinite Trees.- Behaviors of Processes and Synchronized Systems of Processes.- V: Concurrent Programs.- A Tutorial on the Split Binary Semaphore.- A Fixed Point Approach to Applicative Multiprogramming.- Discrete Event Simulation Based on Communicating Sequential Processes.- Structure of an Operating System.
- 巻冊次
-
ISBN 9789027714626
内容説明
Long ago~ the welfare of a sooiety used to depend heavily on the skill and dedioation of its oraftsmen - the miller~ the blaok- smith~ the oobbler and the tailor. These oraftsmen aoquired their skill by a long and poorly paid apprentioeship to some master of their oraft. They learned by imitation and experienoe~ and by tri- al and error. They did not read books or study soienoe~ they knew nothing of the theory of their subjeot~ the geometry of their ru- dimentary drawings~ nor the mathematios underlying their primitive oaloulations. They oould not explain how or why they used their methods; yet they worked effeotively by themselves or in small teams to oomplete their tasks at a predioted oost~ to a fairly well predioted timesoale~ and usually to the satisfaotion of their olients. The programmer of today shares many of these attributes of a oraftsman. He learns his oraft by apprentioeship in an existing team of programmers - but his apprentiaeship is highZy paid and usually very short. He develops his skill by trial; but mostly by error. He does not study theory~ or even read books on Computer Soience.
He knows nothing of the logical and mathematical founda- tions of his profession; and he hates to explain or justifY~ or even to dooument what he has done.
目次
I: Program Development and Verification.- Smoothsort, an Alternative for Sorting in Situ.- Lambek and Moser Revisited.- A General Axiom of Assignment.- Assignment and Linked Data Structures.- A Proof of the Schorr-Waite Algorithm.- Verification of Sequential Programs: Temporal Axiomatization.- Specification and Derivation of Programs.- Repaying Our Debts.- II: Denotational Semantics.- Lectures on a Mathematical Theory of Computation.- Semantic Models.- III: Abstract Data Types.- Algebras, Theories and Freeness: An Introduction for Computer Scientists.- An Analysis of Semantic Models for Algebraic Specifications.- IV: Infinite Structures.- Fundamental Properties of Infinite Trees.- Behaviors of Processes and Synchronized Systems of Processes.- V: Concurrent Programs.- A Tutorial on the Split Binary Semaphore.- A Fixed Point Approach to Applicative Multiprogramming.- Discrete Event Simulation Based on Communicating Sequential Processes.- Structure of an Operating System.
「Nielsen BookData」 より