Beauty Is Our Business: A Birthday Salute to Edsger W. Dijkstra: Monographs in Computer Science
Editat de W.H.J. Feijen, A.J.M. van Gasteren, David Gries, J. Misraen Limba Engleză Hardback – 23 apr 1990
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 1232.10 lei 6-8 săpt. | |
Springer – 16 dec 2011 | 1232.10 lei 6-8 săpt. | |
Hardback (1) | 1236.54 lei 6-8 săpt. | |
Springer – 23 apr 1990 | 1236.54 lei 6-8 săpt. |
Din seria Monographs in Computer Science
- 20% Preț: 1209.56 lei
- 20% Preț: 492.60 lei
- 20% Preț: 320.69 lei
- 20% Preț: 316.25 lei
- 15% Preț: 622.48 lei
- 20% Preț: 344.02 lei
- 20% Preț: 326.71 lei
- 20% Preț: 628.50 lei
- 20% Preț: 317.06 lei
- 20% Preț: 956.08 lei
- 20% Preț: 954.64 lei
- 20% Preț: 1569.03 lei
- 20% Preț: 631.23 lei
- 20% Preț: 625.49 lei
- 20% Preț: 315.76 lei
- 20% Preț: 616.92 lei
- 20% Preț: 321.80 lei
- 18% Preț: 709.83 lei
- 20% Preț: 617.89 lei
- 20% Preț: 617.72 lei
- 20% Preț: 332.59 lei
- 20% Preț: 684.37 lei
- 20% Preț: 963.22 lei
- 20% Preț: 636.44 lei
- 20% Preț: 330.70 lei
- 20% Preț: 620.41 lei
- 15% Preț: 486.24 lei
- 20% Preț: 616.46 lei
- Preț: 381.87 lei
- 18% Preț: 920.57 lei
- 20% Preț: 570.28 lei
- 20% Preț: 317.06 lei
- Preț: 368.94 lei
- 20% Preț: 336.26 lei
- 20% Preț: 800.88 lei
- 20% Preț: 955.76 lei
- 15% Preț: 557.01 lei
- 20% Preț: 325.13 lei
- 20% Preț: 950.69 lei
- 20% Preț: 958.78 lei
- 20% Preț: 1244.31 lei
- 20% Preț: 1397.81 lei
Preț: 1236.54 lei
Preț vechi: 1545.67 lei
-20% Nou
Puncte Express: 1855
Preț estimativ în valută:
236.66€ • 249.66$ • 197.22£
236.66€ • 249.66$ • 197.22£
Carte tipărită la comandă
Livrare economică 02-16 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780387972992
ISBN-10: 0387972994
Pagini: 455
Ilustrații: XX, 455 p.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.79 kg
Ediția:1990
Editura: Springer
Colecția Springer
Seria Monographs in Computer Science
Locul publicării:New York, NY, United States
ISBN-10: 0387972994
Pagini: 455
Ilustrații: XX, 455 p.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.79 kg
Ediția:1990
Editura: Springer
Colecția Springer
Seria Monographs in Computer Science
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
0 Proving Termination of Parallel Programs.- 1 On a Relation on Functions.- 2 Efficient Solution of a Non-Monotonic Inverse Problem.- 3 Semantics of Quasi-Boolean Expressions.- 4 Small Specification Exercises.- 5 Architecture of Real-Time Systems.- 6 The Use of a Formal Simulator to Verify a Simple Real Time Control Program.- 7 Exploring the Future: Trends and Discontinuities.- 8 On a Renewed Visit to the Banker and a Remarkable Analogy.- 9 On Bounded Buffers: Modularity, Robustness, and Reliability in Reactive Systems.- 10 Examples in Program Composition.- 11 On the Mechanism of the Hydrogenation of Edible Oils.- 12 The Problem of the Majority Network.- 13 A Little Exercise in Deriving Multiprograms.- 14 Experimenting with a Refinement Calculus.- 15 Serializable Programs, Parallelizable Assertions: A Basis for Interleaving.- 16 Binary to Decimal, One More Time.- 17 Rotate and Double.- 18 Beautifying Gödel.- 19 A Striptease of Entropy.- 20 On a Theorem of Jacobson.- 21 Modalities of Nondeterminacy.- 22 A Theory for the Derivation of C-mos Circuit Designs.- 23 On Mathematical Induction and the Invariance Theorem.- 24 Formalizing Some Classic Synchronization Primitives.- 25 Consequences.- 26 Shortest and Longest Segments.- 27 A Simple Program Whose Proof Isn’t.- 28 Binding Structure and Behaviour in “Whole Net” Concurrency Semantics.- 29 Maximal Strong Components: An Exercise in Program Presentation.- 30 A Systolic Program for Gauss-Jordan Elimination.- 31 Coding for Channels with Localized Errors.- 32 Topology-Independent Algorithms Based on Spanning Trees.- 33 An Exercise in the Verification of Multi-Process Programs.- 34 The Limitations to Delay-Insensitivity in Asynchronous Circuits.- 35 A Simple Proof of a Simple Consensus Algorithm.- 36 Of wp and CSP.- 37Programming by Expression Refinement: the KMP Algorithm.- 38 Methodical Competitive Snoopy-Caching.- 39 Beauty and the Beast of Software Complexity — Elegance versus Elephants.- 40 A Note on Feasibility.- 41 A Curious Property of Points and Circles in the Plane.- 42 A Problem Involving Subsequences.- 43 A Personal Perspective of the Alpern-Schneider Characterization of Safety and Liveness.- 44 Simpler Proofs for Concurrent Reading and Writing.- 45 Goodbye Junctivity?.- 46 An Assignment Problem for the Vertices of a Cycle.- 47 Duality and De Morgan Principles for Lists.- 48 The Quest for Timeless Specifications Leads to Non-Stepping Automata.- 49 The Maximum Length of a Palindrome in a Sequence.- 50 On Form, Formalism and Equivalence.- 51 Drawing Lines, Circles, and Ellipses in a Raster.- 52 Calculations with Relations, an Example.- 53 Two Proofs for Pythagoras.