Borrow it
Coverart for item
The Resource Foundations of software technology and theoretical computer science : fifth conference, New Delhi, India, December 16-18, 1985 : proceedings, edited by S.N. Maheshwari

Foundations of software technology and theoretical computer science : fifth conference, New Delhi, India, December 16-18, 1985 : proceedings, edited by S.N. Maheshwari

Work
Publication
Extent
1 online resource (ix, 521 pages)
Note
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
Contents
  • 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
Isbn
9783540397229
Instance
Label
Foundations of software technology and theoretical computer science : fifth conference, New Delhi, India, December 16-18, 1985 : proceedings
Title
Foundations of software technology and theoretical computer science
Title remainder
fifth conference, New Delhi, India, December 16-18, 1985 : proceedings
Statement of responsibility
edited by S.N. Maheshwari
Contributor
Subject
Genre
Language
eng
Member of
Action
digitized
Cataloging source
OCLCE
Dewey number
005
Illustrations
illustrations
Index
index present
LC call number
QA76.751
LC item number
.F68 1985
Literary form
non fiction
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorDate
1985
http://library.link/vocab/relatedWorkOrContributorName
  • Maheshwari, S. N
  • Indian Institute of Technology, Delhi
  • Tata Institute of Fundamental Research
  • Conference on Foundations of Software Technology and Theoretical Computer Science
Series statement
Lecture notes in computer science
Series volume
206
http://library.link/vocab/subjectName
  • Computer software
  • Electronic data processing
  • Ordinateurs
  • Logiciels
  • Programmation (Informatique)
  • Informatique
  • Computer software
  • Electronic data processing
  • Kongress
  • Informatik
  • Software
Label
Foundations of software technology and theoretical computer science : fifth conference, New Delhi, India, December 16-18, 1985 : proceedings, edited by S.N. Maheshwari
Instantiates
Publication
Note
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
Antecedent source
file reproduced from original
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
black and white
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
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
Control code
707591610
Dimensions
unknown
Extent
1 online resource (ix, 521 pages)
Form of item
online
Isbn
9783540397229
Level of compression
  • lossless
  • lossy
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations.
Reformatting quality
  • preservation
  • access
Reproduction note
Electronic reproduction.
Specific material designation
remote
System control number
(OCoLC)707591610
System details
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
Label
Foundations of software technology and theoretical computer science : fifth conference, New Delhi, India, December 16-18, 1985 : proceedings, edited by S.N. Maheshwari
Publication
Note
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
Antecedent source
file reproduced from original
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
black and white
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
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
Control code
707591610
Dimensions
unknown
Extent
1 online resource (ix, 521 pages)
Form of item
online
Isbn
9783540397229
Level of compression
  • lossless
  • lossy
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations.
Reformatting quality
  • preservation
  • access
Reproduction note
Electronic reproduction.
Specific material designation
remote
System control number
(OCoLC)707591610
System details
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.

Subject

Genre

Member of

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012

Library Links

Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by University of Missouri Libraries. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...