Foundations of Software Technology and Theoretical Computer Science: Fourth Conference, Bangalore, India December 13-15, 1984. Proceedings by M. JosephFoundations of Software Technology and Theoretical Computer Science: Fourth Conference, Bangalore, India December 13-15, 1984. Proceedings by M. Joseph

Foundations of Software Technology and Theoretical Computer Science: Fourth Conference, Bangalore…

EditorM. Joseph

Paperback | November 1, 1984

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: Fourth Conference, Bangalore…Format:PaperbackDimensions:468 pagesPublished:November 1, 1984Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540138838

ISBN - 13:9783540138839

Look for similar items by category:

Reviews

Table of Contents

Logic for knowledge representation.- Logical specification and implementation.- Process specification of logic programs.- Functional programming systems revisited.- Models and transformations for nondeterministic extensions of functional programming.- Degrees of non-determinism and concurrency: A Petri net view.- Proof rules for communication abstractions.- A distributed algorithm for detecting communication deadlocks.- On the existence and construction of robust communication protocols for unreliable channels.- Heuristic search approach to optimal routing in a distributed architecture.- Replacement in monotone Boolean networks: An algebraic perspective.- A new characterization of BPP.- Treating terminals as function values of time.- Logics of knowledge, games and dynamic logic.- Persistent first class procedures are enough.- Abstraction concepts for modeling screen oriented dialogue interfaces.- VLSI systems for design rule checks.- Bounds on the length of convex partitions of polygons.- On mapping cube graphs onto VLSI arrays.- A linear-time algorithm for determining the intersection type of two star polygons.- Eliminating cascading rollback in structured databases.- Recognition and top-down generation of ?-acyclic database schemes.- Universal and representative instances using unmarked nulls.- On some computational problems related to data base coding.- Generic oracles.- Approximation algorithm for maximum independent set in planar traingle-free graphs.- Grid file algorithms: An analysis in the biased case.- On the mean weight balance factor of binary trees.- An efficient algorithm for random sampling without replacement.- Proof rules for communication abstractions.