000 | 03452nam a22005175i 4500 | ||
---|---|---|---|
001 | 978-3-540-39184-5 | ||
003 | DE-He213 | ||
005 | 20160624101942.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1982 gw | s |||| 0|eng d | ||
020 |
_a9783540391845 _9978-3-540-39184-5 |
||
024 | 7 |
_a10.1007/3-540-11494-7 _2doi |
|
050 | 4 | _aQA76.9.L63 | |
050 | 4 | _aQA76.5913 | |
050 | 4 | _aQA76.63 | |
072 | 7 |
_aUM _2bicssc |
|
072 | 7 |
_aUYF _2bicssc |
|
072 | 7 |
_aCOM051000 _2bisacsh |
|
072 | 7 |
_aCOM036000 _2bisacsh |
|
082 | 0 | 4 |
_a005.1015113 _223 |
245 | 1 | 0 |
_aInternational Symposium on Programming _h[electronic resource] : _b5th Colloquium Turin, April 6–8, 1982 Proceedings / _cedited by Mariangiola Dezani-Ciancaglini, Ugo Montanari. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1982. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1982. |
|
300 |
_aVIII, 416 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 ; _v137 |
|
505 | 0 | _aApplicative communicating processes in first order logic -- A machine-level semantics for nondeterministic, parallel programs -- A formalized proof system for total correctness of while programs -- Automatic program transformation viewed as theorem proving -- An enlarged definition and complete axiomatization of observational congruence of finite processes -- Perluette : A compilers producing system using abstract data types -- A weakest precondition semantics for communicating processes -- From abstract model to efficient compilation of patterns -- Computer-based synthesis of logic programs -- On some syntactic equivalences of program schemas and related transformations -- Procedures and concurrency: A study in proof -- Another characterization of weakest preconditions -- Powerdomains and nondeterministic recursive definitions -- Optimizing for a multiprocessor: Balancing synchronization costs against parallelism in straight-line code -- The simple semantics for Coppo-Dezani-Sallé types -- Proving the correctness of implementations of shared data abstractions -- Specification of communicating processes and process implementation correctness -- A system for reasoning within and about algebraic specifications -- Tuning algebraic specifications by type merging -- Communicating agents for applicative concurrent programming -- On effective computations of non-deterministic schemes -- Specification and verification of concurrent systems in CESAR -- Proof of separability A verification technique for a class of security kernels -- A method for program synthesis -- The use of transformations to implement an algorithm. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aLogic design. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
650 | 2 | 4 | _aProgramming Techniques. |
700 | 1 |
_aDezani-Ciancaglini, Mariangiola. _eeditor. |
|
700 | 1 |
_aMontanari, Ugo. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540114949 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v137 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-11494-7 |
942 |
_2EBK4602 _cEBK |
||
999 |
_c33896 _d33896 |