Computer Aided Verification: 10th International Conference, CAV'98, Vancouver, BC, Canada, June 28-July 2, 1998, Proceedings: Lecture Notes in Computer Science, cartea 1427
Editat de Alan J. Hu, Moshe Y Vardien Limba Engleză Paperback – 3 iun 1998
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1053.45 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 15% Preț: 429.74 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 567.60 lei
- 20% Preț: 575.48 lei
- 20% Preț: 571.63 lei
- 20% Preț: 747.79 lei
- 15% Preț: 568.74 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 574.05 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 747.79 lei
- 20% Preț: 809.19 lei
- 20% Preț: 649.49 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 645.52 lei
Preț vechi: 806.89 lei
-20% Nou
Puncte Express: 968
Preț estimativ în valută:
123.54€ • 128.33$ • 102.62£
123.54€ • 128.33$ • 102.62£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540646082
ISBN-10: 3540646086
Pagini: 568
Ilustrații: X, 552 p.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.79 kg
Ediția:1998
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540646086
Pagini: 568
Ilustrații: X, 552 p.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.79 kg
Ediția:1998
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Synchronous programming of reactive systems.- Ten years of partial order reduction.- An ACL2 proof of write invalidate cache coherence.- Transforming the theorem prover into a digital design tool: From concept car to off-road vehicle.- A role for theorem proving in multi-processor design.- A formal method experience at secure computing corporation.- Formal methods in an industrial environment.- On checking model checkers.- Finite-state analysis of security protocols.- Integrating proof-based and model-checking techniques for the formal verification of cryptographic protocols.- Verifying systems with infinite but regular state spaces.- Formal verification of out-of-order execution using incremental flushing.- Verification of an implementation of Tomasulo's algorithm by compositional model checking.- Decomposing the proof of correctness of pipelined microprocessors.- Processor verification with precise exceptions and speculative execution.- Symmetry reductions in model checking.- Structural symmetry and model checking.- Using magnetic disk instead of main memory in the Mur ? verifier.- On-the-fly model checking of RCTL formulas.- From pre-historic to post-modern symbolic model checking.- Model checking LTL using net unforldings.- Model checking for a first-order temporal logic using multiway decision graphs.- On the limitations of ordered representations of functions.- BDD based procedures for a theory of equality with uninterpreted functions.- Computing reachable control states of systems modeled with uninterpreted functions and infinite memory.- Multiple counters automata, safety analysis and presburger arithmetic.- A comparison of Presburger engines for EFSM reachability.- Generating finite-state abstractions of reactive systems using decision procedures.- On-the-fly analysis of systems with unbounded, lossy FIFO channels.- Computing abstractions of infinite state systems compositionally and automatically.- Normed simulations.- An experiment in parallelizing an application using formal methods.- Efficient symbolic detection of global properties in distributed systems.- A machine-checked proof of the optimality of a real-time scheduling policy.- A general approach to partial order reductions in symbolic verification.- Correctness of the concurrent approach to symbolic verification of interleaved models.- Verification of timed systems using POSETs.- Mechanising BAN Kerberos by the inductive method.- Protocol verification in Nuprl.- You assume, we guarantee: Methodology and case studies.- Verification of a parameterized bus arbitration protocol.- The ‘test model-checking’ approach to the verification of formal memory models of multiprocessors.- Design constraints in symbolic model checking.- Verification of floating-point adders.- Xeve, an Esterel verification environment.- InVeSt : A tool for the verification of invariants.- Verifying mobile processes in the HAL environment.- MONA 1.x: New techniques for WS1S and WS2S.- MOCHA: Modularity in modelchecking.- SCR: A toolset for specifying and analyzing software requirements.- A toolset for message sequence charts.- Real-time verification of Statemate designs.- Optikron: A tool suite for enhancing model-checking of real-time systems.- Kronos: A model-checking tool for real-time systems.