Foundations of Software Technology and Theoretical Computer Science: Seventh Conference, Pune, India, December 17-19, 1987. Proceedings by Kesav V. NoriFoundations of Software Technology and Theoretical Computer Science: Seventh Conference, Pune, India, December 17-19, 1987. Proceedings by Kesav V. Nori

Foundations of Software Technology and Theoretical Computer Science: Seventh Conference, Pune…

EditorKesav V. Nori

Paperback | November 25, 1987

Pricing and Purchase Info

$148.02 online 
$167.95 list price save 11%
Earn 740 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

Title:Foundations of Software Technology and Theoretical Computer Science: Seventh Conference, Pune…Format:PaperbackDimensions:549 pages, 9.25 × 6.1 × 0 inPublished:November 25, 1987Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540186255

ISBN - 13:9783540186250

Look for similar items by category:

Reviews

Table of Contents

Algebraic operational semantics.- On ambiguity of DTOL systems.- The equivalence problem for n-tape finite automata with simple cycles.- Relating the degree of ambiguity of finite automata to the succinctness of their representation.- Automata, games, and positive monadic theories of trees.- An algorithm for colouring perfect planar graphs.- Efficient algorithms for domination and Hamilton circuit problems on permutation graphs.- Fast parallel algorithms for the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs.- Improved bounds for covering general polygons with rectangles.- Submodule construction as equation solving in CCS.- Computations in undistinguished networks.- A distributed algorithm to implement n-party rendezvous.- Merge and termination in process algebra.- Parallelism and programming: A perspective.- On optimal parallelization of sorting networks.- Parallel algorithms for approximate edge colouring of simple graphs.- An optimal randomized routing algorithm for the Mesh and a class of efficient Mesh-like routing networks.- An O(n2) algorithm for fan-out free query optimization.- Weak consistency of read-only transactions: A tool to improve concurrency in heterogeneous locking protocols.- Optimizing join queries in distributed databases.- Reasoning in systems of equations and inequations.- Specification=program+types.- Paraconsistent logic programming.- Semantics of distributed Horn clause programs.- The calculus of constructions : State of the art.- Modules for re-use.- Hierarchical refinement of A Z specification.- Lazy pattern matching in the ML language.- Program development using lambda abstraction.- Relativized Arthur-Merlin versus Merlin-Arthur games.- Probabilistic quantifiers vs. distrustful adversaries.- On certain bandwidth restricted versions of the satisfiability problem of propositional CNF formulas.- A look-ahead interpreter for sequential Prolog and its implementation.- Extension of weakest precondition formalism to a low level language.- Retrospection on the PQCC compiler structure.- Some recent applications of knowledge.