Computer Aided Verification: 3rd International Workshop, CAV '91, Aalborg, Denmark, July 1-4, 1991. Proceedings: Lecture Notes in Computer Science, cartea 575
Editat de Kim G. Larsen, Arne Skouen Limba Engleză Paperback – 22 apr 1992
Din seria Lecture Notes in Computer Science
- 20%
Preț: 426.75 lei - 20%
Preț: 315.62 lei - 20%
Preț: 320.92 lei - 15%
Preț: 426.53 lei - 20%
Preț: 313.87 lei - 20%
Preț: 355.79 lei - 20%
Preț: 355.54 lei - 20%
Preț: 355.18 lei - 20%
Preț: 390.68 lei - 20%
Preț: 392.03 lei - 20%
Preț: 498.95 lei - 20%
Preț: 390.79 lei - 20%
Preț: 495.44 lei - 20%
Preț: 498.80 lei - 20%
Preț: 498.50 lei - 20%
Preț: 355.93 lei - 20%
Preț: 639.52 lei - 20%
Preț: 499.90 lei - 20%
Preț: 498.95 lei - 20%
Preț: 270.68 lei - 20%
Preț: 321.68 lei - 20%
Preț: 391.36 lei - 20%
Preț: 322.09 lei - 20%
Preț: 498.90 lei - 20%
Preț: 312.82 lei - 20%
Preț: 496.73 lei - 20%
Preț: 463.03 lei - 20%
Preț: 531.75 lei - 15%
Preț: 496.40 lei - 20%
Preț: 497.25 lei - 20%
Preț: 498.80 lei - 20%
Preț: 461.86 lei - 20%
Preț: 355.59 lei - 20%
Preț: 324.19 lei -
Preț: 418.19 lei - 20%
Preț: 498.59 lei - 20%
Preț: 391.28 lei - 20%
Preț: 355.69 lei - 15%
Preț: 499.72 lei - 20%
Preț: 499.40 lei - 20%
Preț: 390.42 lei - 20%
Preț: 497.75 lei - 20%
Preț: 326.81 lei - 20%
Preț: 322.32 lei - 20%
Preț: 390.42 lei - 20%
Preț: 458.84 lei - 20%
Preț: 427.09 lei - 20%
Preț: 499.90 lei - 20%
Preț: 320.72 lei
Preț: 329.74 lei
Preț vechi: 412.17 lei
-20% Nou
Puncte Express: 495
Preț estimativ în valută:
58.35€ • 68.05$ • 51.23£
58.35€ • 68.05$ • 51.23£
Carte tipărită la comandă
Livrare economică 15-29 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540551799
ISBN-10: 3540551794
Pagini: 504
Ilustrații: XI, 493 p.
Dimensiuni: 155 x 233 x 26 mm
Greutate: 0.7 kg
Ediția:1992
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540551794
Pagini: 504
Ilustrații: XI, 493 p.
Dimensiuni: 155 x 233 x 26 mm
Greutate: 0.7 kg
Ediția:1992
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Taming infinite state spaces.- Silence is golden: Branching bisimilarity is decidable for context-free processes.- Computing distinguishing formulas for branching bisimulation.- Compositional checking of satisfaction.- An action based framework for verifying logical and behavioural properties of concurrent systems.- A linear-time model-checking algorithm for the alternation-free modal mu-calculus.- Automatic temporal verification of buffer systems.- Mechanically checked proofs of kernel specifications.- A top down approach to the formal specification of SCI cache coherence.- Integer programming in the analysis of concurrent systems.- The lotos model of a fault protected system and its verification using a petri net based approach.- Error diagnosis in finite communicating systems.- Temporal precondition verification of design transformations.- PAM: A process algebra manipulator.- The Concurrency Workbench with priorities.- A proof assistant for PSF.- Avoiding state explosion by composition of minimal covering graphs.- “On the fly” verification of behavioural equivalences and preorders.- Bounded-memory algorithms for verification on-the-fly.- Generating BDDs for symbolic model checking in CCS.- Vectorized symbolic model checking of computation tree logic for sequential machine verification.- Functional extension of symbolic model checking.- An automated proof technique for finite-state machine equivalence.- From data structure to process structure.- Checking for language inclusion using simulation preorders.- A semantic driven method to check the fineteness of CCS processes.- Using the HOL prove assistant for proving the correctness of term rewriting rules reducing terms of sequential behavior.- Mechanizing a proof by induction of process algebra specifications in higher order logic.- A two-level formal verification methodology using HOL and COSMOS.- Efficient algorithms for verification of equivalences for probabilistic processes.- Partial-order model checking: A guide for the perplexed.- Using partial orders for the efficient verification of deadlock freedom and safety properties.- Complexity results for POMSET languages.- Mechanically verifying safety and liveness properties of delay insensitive circuits.- Automating most parts of hardware proofs in HOL.- An overview and synthesis on timed process algebras.- Minimum and maximum delay problems in realtime systems.- Formal verification of speed-dependent asynchronous circuits using symbolic model checking of Branching Time Regular Temporal Logic.- Verifying properties of HMS machine specifications of real-time systems.- A linear time process algebra.- Deciding properties of regular real timed processes.- An algebra of Boolean processes.- Comparing generic state machines.- An automata theoretic approach to Temporal Logic.