Foundations of Software Technology and Theoretical Computer Science [electronic resource] : Fifth Conference, New Delhi, India December 16–18, 1985 Proceedings / edited by S. N. Maheshwari.
Material type: TextSeries: Lecture Notes in Computer Science ; 206Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1985Description: XIII, 527 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540397229Subject(s): Computer science | Software engineering | Logic design | Computer Science | Software Engineering | Logics and Meanings of ProgramsAdditional physical formats: Printed edition:: No titleDDC classification: 005.1 LOC classification: QA76.758Online resources: Click here to access onlineCurrent library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
IMSc Library | IMSc Library | Link to resource | Available | EBK4697 |
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.
There are no comments on this title.