000 | 03386nam a22004695i 4500 | ||
---|---|---|---|
001 | 978-3-540-39722-9 | ||
003 | DE-He213 | ||
005 | 20160624101945.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1985 gw | s |||| 0|eng d | ||
020 |
_a9783540397229 _9978-3-540-39722-9 |
||
024 | 7 |
_a10.1007/3-540-16042-6 _2doi |
|
050 | 4 | _aQA76.758 | |
072 | 7 |
_aUMZ _2bicssc |
|
072 | 7 |
_aCOM051230 _2bisacsh |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aFoundations of Software Technology and Theoretical Computer Science _h[electronic resource] : _bFifth Conference, New Delhi, India December 16–18, 1985 Proceedings / _cedited by S. N. Maheshwari. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1985. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1985. |
|
300 |
_aXIII, 527 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 ; _v206 |
|
505 | 0 | _aThe mathematics of programming -- Concurrent programming using actors: Exploiting large-scale parallelism -- A new class of high level programs for distributed computing systems -- A class of termination detection algorithms for distributed computations -- New protocols for the election of a leader in a ring -- Program simplification via symbolic interpretation -- PROLOG-based inductive theorem proving -- On the calling behaviour of procedures -- Approximation algorithms for planar matching -- Geometric optimization and the polynomial hierarchy -- Deriving object octree from images -- Deduction with relation matching -- Recursively defined domains and their induction principles -- Large database specifications from small views -- A decision method for temporal logic based on resolution -- A generalization of the Parikh vector for finite and infinite words -- The implication problem for functional and multivalued dependencies : An algebraic approach -- A simple characterization of database serializability -- Who needs to verify programs if you can test them -- Partial correctness semantics for CP[?, , &] -- A proof technique for rely/guarantee properties -- A complete proof system for SCCS with modal assertions -- Demand-driven evaluation on dataflow machine -- Design and implementation of a procedural VLSI layout system -- VLSI systems for matrix multiplication -- Parallel algorithms for solving certain classes of linear recurrences -- O(1) parallel time incremental graph algorithms -- NC algorithms for comparability graphs, interval graphs, and testing for unique perfect matching -- Fast and efficient parallel algorithms for the exact inversion of integer matrices. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aLogic design. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
700 | 1 |
_aMaheshwari, S. N. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540160427 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v206 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-16042-6 |
942 |
_2EBK4697 _cEBK |
||
999 |
_c33991 _d33991 |