Table Of Content

Subject index of volume 5 Ada tasking 159 Formal description technique 145 Optimal algorithms 55 Adaptive routing 1 Formal model 145 Agreement 175 Formal proof 25 Parallel algorithm 133 Analysis 145 Formal specification 95 Parallel computation 201 Array partitioning 133 Formal verification 95 Parallelizing compiler 7 Asynchronous circuit 107 Partial correctness 159 Garbage collection 187 Proof system 37 Broadcasting 73 Protocol 25 Byzantine Agreement 219 Hot potato routing 1 Hypercube network 1 Radio networks 67 Clock synchronization 73 Randomization 25 Collision detection 67 Image processing 55 Regular expressions 107 Communication behaviors 107 Invent and verify paradigm 95 Ring configuration 121 Communication protocol 83, 145 Ring network 25 Computation complexity 201 Linear arrays 55 Robust algorithms 201 Concurrent programming 187 Link failures 121 Correctness 187 Liveness 37 Safety 37 CSP 83,95 Lower bounds 121, 201 Self-adjusting algorithm 219 Shortest path 133 Deflection routing 1 Message complexity 121 Specification 145 Delay-insensitive circuit 107 Misrouting 1 Specification case study 83 Distributed parallelism 7 Modularity 159 Systolic array 7, 133 Distributed system 159, 175, 219 Multicasting 73 Multiple access networks 73 Top-down design 95 Emulation 67 Trace semantics 107 Non-determinism 159 Transitive closure 133 Fault tolerance 175, 201, 219 Fault tolerant systems 95 OCCAM 37 VLSI algorithm 133 Subject index of volume 5 Ada tasking 159 Formal description technique 145 Optimal algorithms 55 Adaptive routing 1 Formal model 145 Agreement 175 Formal proof 25 Parallel algorithm 133 Analysis 145 Formal specification 95 Parallel computation 201 Array partitioning 133 Formal verification 95 Parallelizing compiler 7 Asynchronous circuit 107 Partial correctness 159 Garbage collection 187 Proof system 37 Broadcasting 73 Protocol 25 Byzantine Agreement 219 Hot potato routing 1 Hypercube network 1 Radio networks 67 Clock synchronization 73 Randomization 25 Collision detection 67 Image processing 55 Regular expressions 107 Communication behaviors 107 Invent and verify paradigm 95 Ring configuration 121 Communication protocol 83, 145 Ring network 25 Computation complexity 201 Linear arrays 55 Robust algorithms 201 Concurrent programming 187 Link failures 121 Correctness 187 Liveness 37 Safety 37 CSP 83,95 Lower bounds 121, 201 Self-adjusting algorithm 219 Shortest path 133 Deflection routing 1 Message complexity 121 Specification 145 Delay-insensitive circuit 107 Misrouting 1 Specification case study 83 Distributed parallelism 7 Modularity 159 Systolic array 7, 133 Distributed system 159, 175, 219 Multicasting 73 Multiple access networks 73 Top-down design 95 Emulation 67 Trace semantics 107 Non-determinism 159 Transitive closure 133 Fault tolerance 175, 201, 219 Fault tolerant systems 95 OCCAM 37 VLSI algorithm 133