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

M. Joseph et Rudrapatna K. Shyamasundar

ISBN 10: 3540138838 / ISBN 13: 9783540138839

Editore: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1984

Riguardo questo articolo

Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Edition 1984. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Slight signs of wear on the cover. Edition 1984. Ammareal gives back up to 15% of this item's net price to charity organizations. Codice articolo D-484-786

Dati bibliografici

Titolo: Foundations of Software Technology and ...

Casa editrice: Springer-Verlag Berlin and Heidelberg GmbH & Co. K

Data di pubblicazione: 1984

Legatura: Softcover

Condizione: Bon

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.