000 | 02938nam a22004575i 4500 | ||
---|---|---|---|
001 | 978-3-540-35010-1 | ||
003 | DE-He213 | ||
005 | 20160624101931.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1979 gw | s |||| 0|eng d | ||
020 |
_a9783540350101 _9978-3-540-35010-1 |
||
024 | 7 |
_a10.1007/3-540-09541-1 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUY _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
082 | 0 | 4 |
_a004 _223 |
245 | 1 | 0 |
_aMathematical Studies of Information Processing _h[electronic resource] : _bProceedings of the International Conference Kyoto, Japan, August 23–26, 1978 / _cedited by E. K. Blum, M. Paul, S. Takasu. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1979. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1979. |
|
300 |
_aX, 634 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 ; _v75 |
|
505 | 0 | _aOn the abstract specification and formal analysis of synchronization properties of concurrent systems -- On the formal specification and analysis of loosely connected processes -- Synchronized parallel computation and slowdown of translators -- Nondeterminism, parallelism and intermittent assertions -- A formal specification technique for abstract data types with parallelism -- Verifying parallel programs with resource allocation -- Equivalent key problem of the relational database model -- A file organization suitable for relational database operations -- Specified programming -- A calculus for proving properties of while-programs -- "E-correctness" of a set of "computation processes" -- Program synthesis through Gödel's interpretation -- The vienna development method (VDM) -- On a uniform formal description of data structures -- Extending an implementation language to a specification language -- Some design principles and theory for OBJ-0, a language to express and execute algebraic specifications of programs -- The specification and proof of correctness of interactive programs -- On a theory of decision problems in programming languages -- A representative strong equivalence class for accessible flowchart schemes -- Recursive programs as functions in a first order theory. | |
650 | 0 | _aComputer science. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aComputer Science, general. |
700 | 1 |
_aBlum, E. K. _eeditor. |
|
700 | 1 |
_aPaul, M. _eeditor. |
|
700 | 1 |
_aTakasu, S. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540095415 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v75 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-09541-1 |
942 |
_2EBK4136 _cEBK |
||
999 |
_c33430 _d33430 |