|
" Foundations of software technology and theoretical computer science : "
ed. by S.N. Maheshwari.
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
745984
|
| Doc. No
|
:
|
b565933
|
| Main Entry
|
:
|
ed. by S.N. Maheshwari.
|
| Title & Author
|
:
|
Foundations of software technology and theoretical computer science : : fourth conference, Bangalore, India, December 13-15, 1984 : proceedings\ ed. by S.N. Maheshwari.
|
| Publication Statement
|
:
|
Berlin : Springer, ©1984.
|
| Series Statement
|
:
|
Lecture notes in computer science, 181.
|
| Page. NO
|
:
|
(IV, 468 pages) : illustrations
|
| ISBN
|
:
|
3540138838
|
|
|
:
|
: 3540390871
|
|
|
:
|
: 9783540138839
|
|
|
:
|
: 9783540390879
|
| 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.
|
| Subject
|
:
|
Computer programming -- Congresses.
|
| Subject
|
:
|
Computer programming.
|
| Subject
|
:
|
Computers -- Congresses.
|
| Added Entry
|
:
|
Mathai Joseph
|
|
|
:
|
Rudrapatna Shyamasundar
|
| |