Foundations of Software Technology and Theoretical Computer Science: Seventh Conference, Pune, India December 17–19, 1987 Proceedings

Algebraic operational semantics....Pages 1-2
On ambiguity of DTOL systems....Pages 3-14
The equivalence problem for n-tape finite automata with simple cycles....Pages 15-25
Relating the degree of ambiguity of finite automata to the succinctness of their representation....Pages 26-43
Automata, games, and positive monadic theories of trees....Pages 44-57
An algorithm for colouring perfect planar graphs....Pages 58-64
Efficient algorithms for domination and Hamilton circuit problems on permutation graphs....Pages 65-78
Fast parallel algorithms for the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs....Pages 79-94
Improved bounds for covering general polygons with rectangles....Pages 95-102
Submodule construction as equation solving in CCS....Pages 103-123
Computations in undistinguished networks....Pages 124-137
A distributed algorithm to implement n-party rendezvous....Pages 138-152
Merge and termination in process algebra....Pages 153-172
Parallelism and programming: A perspective....Pages 173-194
On optimal parallelization of sorting networks....Pages 195-206
Parallel algorithms for approximate edge colouring of simple graphs....Pages 207-225
An optimal randomized routing algorithm for the Mesh and a class of efficient Mesh-like routing networks....Pages 226-241
An O(n 2 ) algorithm for fan-out free query optimization....Pages 242-264
Weak consistency of read-only transactions: A tool to improve concurrency in heterogeneous locking protocols....Pages 265-281
Optimizing join queries in distributed databases....Pages 282-304
Reasoning in systems of equations and inequations....Pages 305-325
Specification=program+types....Pages 326-339
Paraconsistent logic programming....Pages 340-360
Semantics of distributed Horn clause programs....Pages 361-371
The calculus of constructions : State of the art....Pages 372-372
Modules for re-use....Pages 373-375
Hierarchical refinement of A Z specification....Pages 376-399
Lazy pattern matching in the ML language....Pages 400-419
Program development using lambda abstraction....Pages 420-434
Relativized Arthur-Merlin versus Merlin-Arthur games....Pages 435-442
Probabilistic quantifiers vs. distrustful adversaries....Pages 443-455
On certain bandwidth restricted versions of the satisfiability problem of propositional CNF formulas....Pages 456-469
A look-ahead interpreter for sequential Prolog and its implementation....Pages 470-484
Extension of weakest precondition formalism to a low level language....Pages 485-499
Retrospection on the PQCC compiler structure....Pages 500-527
Some recent applications of knowledge....Pages 528-539