000 | 03497nam a22005295i 4500 | ||
---|---|---|---|
001 | 978-3-540-69345-1 | ||
003 | DE-He213 | ||
005 | 20160624102056.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1998 gw | s |||| 0|eng d | ||
020 |
_a9783540693451 _9978-3-540-69345-1 |
||
024 | 7 |
_a10.1007/BFb0054279 _2doi |
|
050 | 4 | _aQA76.6-76.66 | |
072 | 7 |
_aUM _2bicssc |
|
072 | 7 |
_aCOM051000 _2bisacsh |
|
082 | 0 | 4 |
_a005.11 _223 |
245 | 1 | 0 |
_aMathematics of Program Construction _h[electronic resource] : _b4th International Conference, MPC'98 Marstrand, Sweden, June 15–17, 1998 Proceedings / _cedited by Johan Jeuring. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1998. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1998. |
|
300 |
_aX, 388 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1422 |
|
505 | 0 | _aOn the aesthetics of diagrams -- Generalising monads -- A proof rule for control loops -- Relation-algebraic derivation of spanning tree algorithms -- An application of program derivation techniques to 18th-century mathematics -- Nested datatypes -- An approach to object-orientation in action systems -- Layered graph traversals and Hamiltonian path problems — An algebraic approach -- A unifying framework for correct program construction -- Computation calculus bridging a formalization gap -- An elementary derivation of the alternating bit protocol -- A set-theoretic model for real-time specification and reasoning -- Polytypic downwards accumulations -- Formal derivation of a loadable asynchronous counter -- A semantic approach to secure information flow -- Slack elasticity in concurrent computing -- Beyond fun: Order and membership in polytypic imperative programming -- Convergence of program transformers in the metric space of trees -- Realizability of monotone coinductive definitions and its application to program synthesis -- Calculating a round-robin scheduler. | |
520 | _aThis book consitutes the refereed proceedings of the 4th International Conference on Mathematics of Program Construction, MPC'98, held in Marstrand, near Goteborg, Sweden, in June 1998. The 17 revised full papers presented were selected from 57 submissions; also included are three invited contributions. The volume is devoted to the use of crisp, clear mathematics in the discovery and design of algorithms and in the development of corresponding software and hardware; varoius approaches to formal methods for systems design and analysis are covered. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aComputer software. | |
650 | 0 | _aLogic design. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
650 | 2 | 4 | _aMathematics of Computing. |
700 | 1 |
_aJeuring, Johan. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540645917 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1422 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/BFb0054279 |
942 |
_2EBK7203 _cEBK |
||
999 |
_c36497 _d36497 |