Foundations of Software Technology and Theoretical Computer Science: Fourth Conference, Bangalore, India December 13-15, 1984. Proceedings (Lecture Notes in Computer Science) (v. 181)

M. Joseph, R. Shyamasundar

ISBN 10: 3540138838 / ISBN 13: 9783540138839

Editore: Springer, 1984

Riguardo questo articolo

*FREE DOMESTIC SHIPPING until Monday, May 19** 468 pp., Paperback, ex library, else text clean and binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Codice articolo ZB694898

Dati bibliografici

Titolo: Foundations of Software Technology and ...

Casa editrice: Springer

Data di pubblicazione: 1984

Legatura: Brossura

Condizione: Good

Descrizione articolo

Contenuti:

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.