Foundations of Software Technology and Theoretical Computer Science

S. N. Maheshwari

ISBN 10: 3540160426 / ISBN 13: 9783540160427

Editore: Springer Berlin Heidelberg Nov 1985, 1985

Riguardo questo articolo

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 536 pp. Englisch.

Codice articolo 9783540160427

Dati bibliografici

• Titolo: Foundations of Software Technology and Theoretical Computer Science
• Editore: Springer Berlin Heidelberg Nov 1985
• Data di pubblicazione: 1985
• Lingua: Inglese
• ISBN 10: 3540160426
• ISBN 13: 9783540160427
• Rilegatura: Taschenbuch
• Condizione: Neu
• Dimensioni: 235 L x 155 A x 29 P (millimetri) 235 millimetri di larghezza per 155 millimetri di altezza per 29 millimetri di profondità
• Peso: 803 grammi

Descrizione articolo

Riassunto

Fondamenti della tecnologia software e dell'informatica teorica: Quinta conferenza, Nuova Delhi, India, 16-18 dicembre 1985. Atti Fondamenti della tecnologia software e dell'informatica teorica: Quinta conferenza, Nuova Delhi, India, 16-18 dicembre 1985. Atti

Contenuti

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.