5. FSTTCS 1985: New Delhi, India

S. N. Maheshwari (Ed.): 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 1985, ISBN 3-540-16042-6 BibTeX

@proceedings{DBLP:conf/fsttcs/1985,
  editor    = {S. N. Maheshwari},
  title     = {Foundations of Software Technology and Theoretical Computer Science,
               Fifth Conference, New Delhi, India, December 16-18, 1985, Proceedings},
  booktitle = {FSTTCS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {206},
  year      = {1985},
  isbn      = {3-540-16042-6},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Keynote Address

C. A. R. Hoare: The Mathematics of Programming. 1-18 BibTeX

Session 1: Distributed and Concurrent Programming

Gul Agha, Carl Hewitt: Concurrent Programming Using Actors: Exploiting large-Scale Parallelism. 19-41 BibTeX
S. Ramesh, S. L. Mehndiratta: A New Class of High Level Programs for Distributed Computing Systems. 42-72 BibTeX
Devendra Kumar: A Class of Termination Detection Algorithms For Distributed Computation. 73-100 BibTeX
Alberto Marchetti-Spaccamela: New Protocols for the Election od a Leader in a Ring. 101-115 BibTeX

Session 2: Programming

Carlo Ghezzi, Dino Mandrioli, Antonio Tecchio: Program Simplification via Symbolic Interpretation. 116-128 BibTeX
Jieh Hsiang, Mandayam K. Srivas: PROLOG-Based Inductive Theorem Proving. 129-149 BibTeX
Dieter Armbruster: On the Calling Behaviour of Procedures. 150-161 BibTeX

Session 3: Algorithms

Shankar M. Venkatesan: Approximation Algorithms for Planar Matching. 162-175 BibTeX
Chandrajit L. Bajaj: Geometric Optimization and Polynomial Hierarchy. 176-195 BibTeX
Jack Veenstra: Deriving Object Octree from Images. 196-211 BibTeX

Invited Talk

Zohar Manna, Richard J. Waldinger: Deduction with Relation Matching. 212-224 BibTeX

Session 4: Specification

Finn Verner Jensen, Kim Guldstrand Larsen: Recursively Defined Domains and Their Induction Principles. 225-245 BibTeX
Samit Khosla, T. S. E. Maibaum, M. R. Sadler: Large Database Specification from Small Views. 246-271 BibTeX

Session 5: Theory

G. Venkatesh: A Decision Method for Temporal Logic Based on Resolution. 272-289 BibTeX
Rani Siromoney, V. Rajkumar Dare: A Generalization of the Parikh Vector for Finite and Infinite Words. 290-302 BibTeX
V. S. Lakshmanan, C. E. Veni Madhavan: The Implication Problem for Functional and Multivalued Dependencies: An Algebraic Approach. 303-328 BibTeX
K. Vidyasankar: A Simple Characterization of Database Serializability. 329-345 BibTeX

Session 6: Semantics and Proof Techniques

Vijay A. Saraswat: Partial correctness semantics for CP [ , | , &]. 347-368 BibTeX
Eugene W. Stark: A Proof Technique for Rely/Guarantee Properties. 369-391 BibTeX
Glynn Winskel: A Complete System for SCCS with Modal Assertions. 392-410 BibTeX

Invited Talk

Arvind: Demand-Driven Evaluation on Dataflow Machine. 411 BibTeX

Session 7: VLSI

Jose M. Mata: Design and Implementation for a Procedural VLSI Layout. 412-427 BibTeX
Kam-Hoi Cheng, Sartaj Sahni: VLSI Systems For Matrix Multiplication. 428-456 BibTeX

Sesson 8: Parallel Algorithms

S. Lakshmivarahan, Sudarshan K. Dhall: Parallel Algorithms for Solving Certain Classes of Linear Recurrences. 457-478 BibTeX
Deepak D. Sherlekar, Shaunak Pawagi, I. V. Ramakrishnan: O(1) Parallel Time Incremental Graph Algorithms. 477-495 BibTeX
Dexter Kozen, Umesh V. Vazirani, Vijay V. Vazirani: NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching. 496-503 BibTeX
Victor Y. Pan: Fast and Efficient Parallel Algorithms for the Exact Inversion of Integer Matrices. 504-519 BibTeX