|
|
|
|
| LEADER |
03376nmm a2200325 u 4500 |
| 001 |
EB000673948 |
| 003 |
EBX01000000000000000527030 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783642775727
|
| 100 |
1 |
|
|a Broy, Manfred
|e [editor]
|
| 245 |
0 |
0 |
|a Programming and Mathematical Method
|h Elektronische Ressource
|b International Summer School
|c edited by Manfred Broy
|
| 250 |
|
|
|a 1st ed. 1992
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1992, 1992
|
| 300 |
|
|
|a VIII, 407 p
|b online resource
|
| 505 |
0 |
|
|a 1. Examples of Derivations -- On the Design of a Simple Proof for Morley’s Theorem -- Well-Foundedness and the Transitive Closure -- Designing the Proof of Vizing’s Theorem -- Phase Synchronization for Two Machines -- The Lexicographic Minimum of a Cyclic Array -- 2. Rules of Programming -- Metalevel Programming in Constructive Type Theory -- Laws of Programming -- Some Applications of Pointer Algebra -- Some Generalizations and Applications of Dijkstra’s Guarded Commands -- 3 Refinement and Program Composition -- A Theoryof Program Composition -- Lectures on Data Refinement -- Refinement Alerebra Proves Correctness of Compilation -- 4 Distributed Svstems -- Process Algebra with Signals and Conditions -- Functional Specification of Time Sensitive Communicating Systems -- Systematic Derivation of Communicating Programs
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Software engineering
|
| 653 |
|
|
|a Programming Techniques
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computer programming
|
| 653 |
|
|
|a Software Engineering
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a NATO ASI Subseries F:, Computer and Systems Sciences
|
| 028 |
5 |
0 |
|a 10.1007/978-3-642-77572-7
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-642-77572-7?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.11
|
| 520 |
|
|
|a The Summer School in Marktoberdorf 1990 had as its overall theme the development of programs as an activity that can be carried out based on and supported by a mathematical method. In particular mathematical methods for the development of programs as parts of distributed systems were included. Mathematical programming methods are a very important topic for which a lot of research in recent years has been carried out. In the Marktoberdorf Summer School outstanding scientists lectured on mathematical programming methods. The lectures centred around logical and functional calculi for the • specification, • refinement, • verification of programs and program systems. Some extremely remarkable examples were given. Looking at these examples it becomes clear that proper research and teaching in the area of program methodology should always show its value by being applied at least to small examples or case studies. It is one of the problems of computing science that examples and case studies have to be short and small to be lJresentable in lectures and papers of moderate size. However, even small examples can tell a lot about the tractability and adequacy of methods and being able to treat small examples does at least prove that the method can be applied in modest ways. Furthermore it demonstrates to some extent the notational and calculational overhead of applying formal methods
|