Foundations of software technology and theoretical computer science : fifth conference, New Delhi, India, December 16-18, 1985 : proceedings
著者
書誌事項
Foundations of software technology and theoretical computer science : fifth conference, New Delhi, India, December 16-18, 1985 : proceedings
（Lecture notes in computer science, 206）
Springer-Verlag, c1985
- : gw
- : us
- タイトル別名
-
FST and TCS 5
大学図書館所蔵 件 / 全59件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Fifth Conference on Foundations of Software Technology and Theoretical Computer Science sponsored jointly by Indian Institute of Technology Delhi and Tata Institute of Fundamental Research, Bombay
Includes bibliographies and index
内容説明・目次
目次
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.
「Nielsen BookData」 より
