Computer Aided Verification: 5th International Conference, CAV'93, Elounda, Greece, June 28 - July 1, 1993. Proceedings: Lecture Notes in Computer Science, cartea 697
Editat de Costas Courcoubetisen Limba Engleză Paperback – 16 iun 1993
Din seria Lecture Notes in Computer Science
- 20%
Preț: 461.83 lei - 20%
Preț: 461.57 lei - 20%
Preț: 424.26 lei - 20%
Preț: 390.69 lei - 20%
Preț: 498.50 lei - 15%
Preț: 388.50 lei - 20%
Preț: 390.35 lei - 20%
Preț: 460.98 lei - 20%
Preț: 461.52 lei - 20%
Preț: 497.55 lei - 20%
Preț: 389.72 lei - 20%
Preț: 461.83 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 391.14 lei - 20%
Preț: 389.85 lei - 20%
Preț: 461.32 lei - 20%
Preț: 498.32 lei - 20%
Preț: 496.64 lei - 20%
Preț: 532.28 lei - 20%
Preț: 527.36 lei - 20%
Preț: 498.46 lei - 15%
Preț: 461.85 lei - 20%
Preț: 390.12 lei - 20%
Preț: 532.41 lei - 20%
Preț: 462.24 lei - 20%
Preț: 391.14 lei - 20%
Preț: 461.77 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 392.64 lei - 20%
Preț: 252.15 lei - 20%
Preț: 390.94 lei - 20%
Preț: 461.52 lei - 20%
Preț: 391.86 lei - 20%
Preț: 532.54 lei - 20%
Preț: 462.67 lei - 20%
Preț: 461.65 lei - 20%
Preț: 639.72 lei - 20%
Preț: 255.91 lei - 15%
Preț: 535.92 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 499.36 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.20 lei - 20%
Preț: 249.95 lei
Preț: 330.54 lei
Preț vechi: 413.16 lei
-20% Nou
Puncte Express: 496
Preț estimativ în valută:
58.50€ • 68.60$ • 51.29£
58.50€ • 68.60$ • 51.29£
Carte tipărită la comandă
Livrare economică 26 ianuarie-09 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540569220
ISBN-10: 3540569227
Pagini: 520
Ilustrații: X, 510 p.
Dimensiuni: 155 x 233 x 27 mm
Greutate: 0.73 kg
Ediția:1993
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540569227
Pagini: 520
Ilustrații: X, 510 p.
Dimensiuni: 155 x 233 x 27 mm
Greutate: 0.73 kg
Ediția:1993
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Logic synthesis and design verification.- Efficient verification with BDDs using implicitly conjoined invariants.- Parametric circuit representation using inductive Boolean functions.- An iterative approach to language containment.- BDD-Based debugging of designs using language containment and fair CTL.- Reliable hashing without collision detection.- A tool for symbolic program verification and abstraction.- Symbolic equivalence checking.- A decision algorithm for full propositional temporal logic.- Reachability and recurrence in Extended Finite State Machines: Modular Vector Addition Systems.- Automatic generation of network invariants for the verification of iterative sequential systems.- A Graphical Interval Logic toolset for verifying concurrent systems.- Combining model checking and theorem proving to verify parallel processes.- Verification of a multiplier: 64 bits and beyond.- Protocol design for an automated highway system.- Computing accumulated delays in real-time systems.- Reachability analysis of planar multi-linear systems.- An efficient algorithm for minimizing real-time transition systems.- Verification of timing properties of VHDL.- Alternating RQ timed automata.- Timed modal specification — Theory and tools.- A mechanically verified application for a mechanically verified environment.- Verification of real-time systems using PVS.- The formal verification of an algorithm for interactive consistency under a hybrid fault model.- Computer-assisted simulation proofs.- A verifier and timing analyser for simple imperative programs.- Efficient verification of parallel real-time systems.- Delay analysis in synchronous programs.- Verifying quantitative real-time properties of synchronous programs.- A modal logic for message passing processes.- Functionality decomposition by compositional correctness preserving transformation.- On model-checking for fragments of ?-calculus.- On-the-fly verification with stubborn sets.- All from one, one for all: on model checking using representatives.- Verifying timed behavior automata with input/output critical races.- Refining dependencies improves partial-order verification methods (extended abstract).- Exploiting symmetry in temporal logic model checking.- Symmetry and model checking.- Generation of reduced models for checking fragments of CTL.- A Structural linearization principle for processes.