<電子ブック>
Foundations of Software Technology and Theoretical Computer Science : Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings / edited by S.N. Maheshwari
(Lecture Notes in Computer Science. ISSN:16113349 ; 206)
版 | 1st ed. 1985. |
---|---|
出版者 | Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer |
出版年 | 1985 |
本文言語 | 英語 |
大きさ | XIII, 527 p : online resource |
著者標目 | Maheshwari, S.N editor SpringerLink (Online service) |
件 名 | LCSH:Software engineering LCSH:Computer science FREE:Software Engineering FREE:Computer Science Logic and Foundations of Programming |
一般注記 | The 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 HTTP:URL=https://doi.org/10.1007/3-540-16042-6 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
|
Springer eBooks | 9783540397229 |
|
電子リソース |
|
EB00224852 |