Foundations of Software Technology and Theoretical Computer Science: Fourth Conference, Bangalore, India December 13–15, 1984 Proceedings

Logic for knowledge representation....Pages 1-12
Logical specification and implementation....Pages 13-30
Process specification of logic programs....Pages 31-43
Functional programming systems revisited....Pages 44-59
Models and transformations for nondeterministic extensions of functional programming....Pages 60-88
Degrees of non-determinism and concurrency: A Petri net view....Pages 89-117
Proof rules for communication abstractions....Pages 118-118
A distributed algorithm for detecting communication deadlocks....Pages 119-135
On the existence and construction of robust communication protocols for unreliable channels....Pages 136-151
Heuristic search approach to optimal routing in a distributed architecture....Pages 152-164
Replacement in monotone Boolean networks: An algebraic perspective....Pages 165-178
A new characterization of BPP....Pages 179-187
Treating terminals as function values of time....Pages 188-201
Logics of knowledge, games and dynamic logic....Pages 202-222
Persistent first class procedures are enough....Pages 223-240
Abstraction concepts for modeling screen oriented dialogue interfaces....Pages 241-258
VLSI systems for design rule checks....Pages 259-278
Bounds on the length of convex partitions of polygons....Pages 279-295
On mapping cube graphs onto VLSI arrays....Pages 296-316
A linear-time algorithm for determining the intersection type of two star polygons....Pages 317-330
Eliminating cascading rollback in structured databases....Pages 331-343
Recognition and top-down generation of β-acyclic database schemes....Pages 344-366
Universal and representative instances using unmarked nulls....Pages 367-378
On some computational problems related to data base coding....Pages 379-379
Generic oracles....Pages 380-380
Approximation algorithm for maximum independent set in planar traingle-free graphs....Pages 381-392
Grid file algorithms: An analysis in the biased case....Pages 393-418
On the mean weight balance factor of binary trees....Pages 419-434
An efficient algorithm for random sampling without replacement....Pages 435-442
Proof rules for communication abstractions....Pages 443-465