Computer Aided Verification: 13th International Conference, CAV 2001, Paris, France, July 18-22, 2001. Proceedings: Lecture Notes in Computer Science, cartea 2102
Editat de Gerard Berry, Hubert Comon, Alain Finkelen Limba Engleză Paperback – 4 iul 2001
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 341.95 lei
- 20% Preț: 369.12 lei
- 20% Preț: 645.28 lei
- 20% Preț: 591.51 lei
- 15% Preț: 580.46 lei
- Preț: 410.88 lei
- 20% Preț: 504.57 lei
- Preț: 381.21 lei
- 20% Preț: 340.32 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 538.29 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 238.01 lei
- 17% Preț: 360.19 lei
- 20% Preț: 438.69 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 596.46 lei
- 15% Preț: 438.59 lei
- 20% Preț: 655.02 lei
- 20% Preț: 649.49 lei
- 20% Preț: 309.90 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 310.26 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 326.98 lei
- 20% Preț: 825.93 lei
- 17% Preț: 427.22 lei
- 20% Preț: 763.23 lei
- 20% Preț: 350.21 lei
- 20% Preț: 307.71 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 20% Preț: 343.62 lei
- 20% Preț: 583.40 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 353.50 lei
- 20% Preț: 607.39 lei
Preț: 657.49 lei
Preț vechi: 821.87 lei
-20% Nou
Puncte Express: 986
Preț estimativ în valută:
125.84€ • 130.88$ • 105.46£
125.84€ • 130.88$ • 105.46£
Carte tipărită la comandă
Livrare economică 14-28 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540423454
ISBN-10: 3540423451
Pagini: 536
Ilustrații: XIII, 522 p.
Dimensiuni: 155 x 233 x 28 mm
Greutate: 0.75 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540423451
Pagini: 536
Ilustrații: XIII, 522 p.
Dimensiuni: 155 x 233 x 28 mm
Greutate: 0.75 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Talk.- Software Documentation and the Verification Process.- Model Checking and Theorem Proving.- Certifying Model Checkers.- Formalizing a JVML Verifier for Initialization in a Theorem Prover.- Automated Inductive Verification of Parameterized Protocols?.- Automata Techniques.- Efficient Model Checking Via Büchi Tableau Automata?.- Fast LTL to Büchi Automata Translation.- A Practical Approach to Coverage in Model Checking.- Verification Core Technology.- A Fast Bisimulation Algorithm.- Symmetry and Reduced Symmetry in Model Checking?.- Transformation-Based Verification Using Generalized Retiming.- BDD and Decision Procedures.- Meta-BDDs: A Decomposed Representation for Layered Symbolic Manipulation of Boolean Functions.- CLEVER: Divide and Conquer Combinational Logic Equivalence VERification with False Negative Elimination.- Finite Instantiations in Equivalence Logic with Uninterpreted Functions.- Abstraction and Refinement.- Model Checking with Formula-Dependent Abstract Models.- Verifying Network Protocol Implementations by Symbolic Refinement Checking.- Automatic Abstraction for Verification of Timed Circuits and Systems?.- Combinations.- Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM?.- Analysis of Recursive State Machines.- Parameterized Verification with Automatically Computed Inductive Assertions?.- Tool Presentations: Rewriting and Theorem-Proving Techniques.- EVC: A Validity Checker for the Logic of Equality with Uninterpreted Functions and Memories, Exploiting Positive Equality, and Conservative Transformations.- AGVI — Automatic Generation, Verification, and Implementation of Security Protocols.- ICS: Integrated Canonizer and Solver?.- µCRL: A Toolset for Analysing Algebraic Specifications.- Truth/SLC — A Parallel Verification Platform for Concurrent Systems.- The SLAM Toolkit.- Invited Talk.- Java Bytecode Verification: An Overview.- Infinite State Systems.- Iterating Transducers.- Attacking Symbolic State Explosion.- A Unifying Model Checking Approach for Safety Properties of Parameterized Systems.- A BDD-Based Model Checker for Recursive Programs.- Temporal Logics and Verification.- Model Checking the World Wide Web?.- Distributed Symbolic Model Checking for ?-Calculus.- Tool Presentations: Model-Checking and Automata Techniques.- The Temporal Logic Sugar.- TReX: A Tool for Reachability Analysis of Complex Systems.- BOOSTER: Speeding Up RTL Property Checking of Digital Designs by Word-Level Abstraction.- SDLcheck: A Model Checking Tool.- EASN: Integrating ASN.1 and Model Checking.- Rtdt: A Front-End for Efficient Model Checking of Synchronous Timing Diagrams.- TAXYS: A Tool for the Development and Verification of Real-Time Embedded Systems?.- Microprocessor Verification, Cache Coherence.- Microarchitecture Verification by Compositional Model Checking.- Rewriting for Symbolic Execution of State Machine Models.- Using Timestamping and History Variables to Verify Sequential Consistency.- SAT, BDDs, and Applications.- Benefits of Bounded Model Checking at an Industrial Setting.- Finding Bugs in an Alpha Microprocessor Using Satisfiability Solvers.- Towards Efficient Verification of Arithmetic Algorithms over Galois Fields GF(2m).- Timed Automata.- Job-Shop Scheduling Using Timed Automata?.- As Cheap as Possible: Effcient Cost-Optimal Reachability for Priced Timed Automata.- Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks.
Caracteristici
Includes supplementary material: sn.pub/extras