VLSI Algorithms and Architectures: Aegean Workshop on Computing, Loutraki, Greece, July 8-11, 1986. Proceedings, 2. sējumsFillia Makedon, Kurt Mehlhorn, T. Papatheodorou, P. Spirakis Springer Science & Business Media, 1986 - 328 lappuses Introduction to the temporal logic of - in particular paral- lel - programs.Divided into three main parts: - Presenta- tion of the pure temporal logic: language, semantics, and proof theory; - Representation of programs and their proper- ties within the language of temporal logic; - Application of the logical apparatus to the verification of program proper- ties including a new embedding of Hoare's logic into the temporal framework. |
Saturs
I | 1 |
II | 12 |
III | 26 |
IV | 34 |
V | 46 |
VI | 57 |
VII | 70 |
VIII | 84 |
XVI | 180 |
XVII | 194 |
XVIII | 205 |
XIX | 217 |
XX | 226 |
XXI | 236 |
XXII | 246 |
XXIII | 252 |
IX | 96 |
X | 108 |
XI | 121 |
XII | 133 |
XIII | 144 |
XIV | 156 |
XV | 166 |
XXIV | 261 |
XXV | 271 |
XXVI | 283 |
XXVII | 296 |
XXVIII | 305 |
XXIX | 317 |
Citi izdevumi - Skatīt visu
VLSI Algorithms and Architectures Fillia Makedon,Kurt Mehlhorn,T. Papatheodorou Priekšskatījums nav pieejams - 2014 |
Bieži izmantoti vārdi un frāzes
arithmetic assigned assume asymptotic bits book embedding Boolean Boolean circuit candidate pair cell channel width circuit CMOS complexity Computer Science conflict number connected consider constant corresponding cutwidth decomposition defined denote edges efficient elements Euler path Figure function given graph G hierarchical hypergraph i/o schedule implementation input integer interchange steps internal internal-external routing jump L-chain label leaf Lemma linear LMJ schedule LMJ sequence lower bound matrix maximum method minimal minimum number mixed routing multiplication NP-complete O(log obtain operations optimal outerplanar graphs output parallel algorithm parallel computation partial layout path planar graphs polynomial problem Proc procedure processor Proof rectangles recursive requires series-parallel series-parallel graph solving sorting sorting algorithm st-numbering subcell subcircuits subgraph systolic array T₁ tasks terminal row Theorem tion topological sort transistors vector vertex vertices VLSI wires
Populāri fragmenti
270. lappuse - P. van Emde Boas, R. Kaas, E. Zijlstra, "Design and implementation of an efficient priority queue," Mathematical Systems Theory, 10, pp.