Foundations of Software Technology and Theoretical Computer Science

For more than a decade, Foundations of Software Technologyand Theoretical Computer Science Conferences have beenproviding an annual academic computerscience forum for thepresentation of new results in the topics of currentresearch in India and abroad. This year, there was a totalof 125 papers from 14 countries. Each paper was reviewed byat least three reviewers; based on these reviews, theprogramme committee selected 28 papers at a meeting held inJuly 1992 at the Tata Institute of Fundamental Research,Bombay.The selected papers are included in this volume, togetherwith three invited papers: "Games and full completeness formultiplicative linear logic" by S. Abramsky, "Recentdevelopments inalgorithms for the maximum-flow problem" byK. Melhorn, and "System specification and refinement intemporal logic" by A. Pnueli.

System specification and refinement in temporal logic.- Fixed points of Büchi automata.- An automata-theoretic decision procedure for Future Interval Logic.- Improving the results of static analyses of programs by local decreasing iterations.- Implicit point location in arrangements of line segments, with an application to motion planning.- An optimal algorithm for the intersection radius of a set of convex polygons.- C-sensitive triangulations approximate the minmax length triangulation.- Superpolynomial circuits, almost sparse oracles and the exponential hierarchy.- Structural average case complexity.- On bounded truth-table, conjunctive, and randomized reductions to sparse sets.- One-way functions and isomorphism conjecture.- Solving the Lagrangian dual when the number of constraints is fixed.- Superfiniteness of query answers in deductive databases: An automata-theoretic approach.- Proving polynomials positive.- An abstract interpretation scheme for groundness, freeness, and sharing analysis of logic programs.- Polymorphic typing by abstract interpretation.- The Gallina specification language: A case study.- Verification of large software systems.- Detection of unstable predicates in distributed programs.- Fast sequential and randomised parallel algorithms for rigidity and approximate min k-cut.- Approximation through local optimality: Designing networks with small degree.- Games and full Completeness for multiplicative Linear Logic.- Real-time calculi and expansion theorems.- Branching bisimulation for context-free processes.- CCS, locations and asynchronous transition systems.- Reasoning about safety and liveness properties for probabilistic processes.- String matching under a general matching relation.- On the complexity of Certified Write All Algorithms.-Selection from read-only memory and sorting with optimum data movement.- Some observations on 2-way probabilistic finite automata.- Recent developments in algorithms for the maximum-flow problem.