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ț: 1018.35 lei
- 20% Preț: 322.44 lei
- 20% Preț: 324.00 lei
- 20% Preț: 315.78 lei
- 20% Preț: 238.01 lei
- 20% Preț: 554.98 lei
- 20% Preț: 322.44 lei
- 20% Preț: 438.69 lei
- 20% Preț: 1005.39 lei
- 20% Preț: 325.58 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 970.25 lei
- 20% Preț: 1339.86 lei
- 20% Preț: 782.28 lei
- 17% Preț: 360.19 lei
- 20% Preț: 620.45 lei
- 20% Preț: 307.71 lei
- 20% Preț: 550.29 lei
- 20% Preț: 560.32 lei
- 20% Preț: 319.32 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 256.27 lei
- 20% Preț: 172.69 lei
- 20% Preț: 548.74 lei
- 20% Preț: 315.19 lei
- 20% Preț: 611.22 lei
- 20% Preț: 315.78 lei
- 20% Preț: 552.64 lei
- 20% Preț: 722.90 lei
- 20% Preț: 722.90 lei
- 20% Preț: 301.95 lei
- 20% Preț: 504.57 lei
- 20% Preț: 1120.51 lei
- 20% Preț: 369.12 lei
- 20% Preț: 334.94 lei
- 20% Preț: 552.64 lei
- Preț: 389.31 lei
- 20% Preț: 564.99 lei
- 20% Preț: 724.49 lei
- 20% Preț: 552.64 lei
- 15% Preț: 549.86 lei
- 20% Preț: 331.82 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 325.58 lei
Preț vechi: 406.98 lei
-20% Nou
Puncte Express: 488
Preț estimativ în valută:
62.33€ • 67.53$ • 52.05£
62.33€ • 67.53$ • 52.05£
Carte tipărită la comandă
Livrare economică 12-26 decembrie
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.