Computer Aided Verification: 12th International Conference, CAV 2000 Chicago, IL, USA, July 15-19, 2000 Proceedings: Lecture Notes in Computer Science, cartea 1855
Editat de E. Allen Emerson, A. Prasad Sistlaen Limba Engleză Paperback – 28 iun 2000
Din seria Lecture Notes in Computer Science
- 20% Preț: 571.63 lei
- 20% Preț: 336.71 lei
- 20% Preț: 333.46 lei
- 20% Preț: 662.76 lei
- 20% Preț: 330.23 lei
- 20% Preț: 747.79 lei
- 20% Preț: 438.67 lei
- 20% Preț: 369.12 lei
- 20% Preț: 315.76 lei
- 20% Preț: 584.40 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 315.18 lei
- 20% Preț: 256.26 lei
- 20% Preț: 1040.03 lei
- 20% Preț: 504.56 lei
- Preț: 402.62 lei
- 20% Preț: 346.40 lei
- 20% Preț: 301.94 lei
- 20% Preț: 237.99 lei
- 5% Preț: 365.59 lei
- 20% Preț: 309.89 lei
- 20% Preț: 321.95 lei
- 20% Preț: 310.25 lei
- 20% Preț: 334.68 lei
- Preț: 373.56 lei
- 20% Preț: 172.68 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 315.76 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 444.17 lei
- 20% Preț: 567.60 lei
- 20% Preț: 632.22 lei
- 17% Preț: 360.18 lei
- 20% Preț: 538.28 lei
- 20% Preț: 335.08 lei
- 20% Preț: 307.68 lei
- 20% Preț: 343.16 lei
- 20% Preț: 641.78 lei
- 20% Preț: 579.56 lei
- 20% Preț: 1053.45 lei
- 15% Preț: 568.74 lei
- Preț: 389.47 lei
- 20% Preț: 333.46 lei
- 20% Preț: 607.38 lei
- 20% Preț: 326.97 lei
Preț: 647.12 lei
Preț vechi: 808.90 lei
-20% Nou
Puncte Express: 971
Preț estimativ în valută:
123.83€ • 130.28$ • 102.53£
123.83€ • 130.28$ • 102.53£
Carte tipărită la comandă
Livrare economică 14-28 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540677703
ISBN-10: 3540677704
Pagini: 600
Ilustrații: X, 590 p.
Dimensiuni: 155 x 233 x 32 mm
Greutate: 0.83 kg
Ediția:2000
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540677704
Pagini: 600
Ilustrații: X, 590 p.
Dimensiuni: 155 x 233 x 32 mm
Greutate: 0.83 kg
Ediția:2000
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Talks and Tutorials.- Keynote Address: Abstraction, Composition, Symmetry, and a Little Deduction: The Remedies to State Explosion.- Invited Address: Applying Formal Methods to Cryptographic Protocol Analysis.- Invited Tutorial: Boolean Satisfiability Algorithms and Applications in Electronic Design Automation.- Invited Tutorial: Verification of Infinite-state and Parameterized Systems.- Regular Papers.- An Abstraction Algorithm for the Verification of Generalized C-Slow Designs.- Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits.- An Automata-Theoretic Approach to Reasoning about Infinite-State Systems.- Automatic Verification of Parameterized Cache Coherence Protocols.- Binary Reachability Analysis of Discrete Pushdown Timed Automata.- Boolean Satisfiability with Transitivity Constraints.- Bounded Model Construction for Monadic Second-Order Logics.- Building Circuits from Relations.- Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking.- On the Completeness of Compositional Reasoning.- Counterexample-Guided Abstraction Refinement.- Decision Procedures for Inductive Boolean Functions Based on Alternating Automata.- Detecting Errors Before Reaching Them.- A Discrete Strategy Improvement Algorithm for Solving Parity Games.- Distributing Timed Model Checking — How the Search Order Matters.- Efficient Algorithms for Model Checking Pushdown Systems.- Efficient Büchi Automata from LTL Formulae.- Efficient Detection of Global Properties in Distributed Systems Using Partial-Order Methods.- Efficient Reachability Analysis of Hierarchical Reactive Machines.- Formal Verification of VLIW Microprocessors with Speculative Execution.- Induction in Compositional Model Checking.- Liveness and Acceleration in Parameterized Verification.- Mechanical Verification of an Ideal Incremental ABR Conformance Algorithm.- Model Checking Continuous-Time Markov Chains by Transient Analysis.- Model-Checking for Hybrid Systems by Quotienting and Constraints Solving.- Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification.- Regular Model Checking.- Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems.- Syntactic Program Transformations for Automatic Abstraction.- Temporal-logic Queries.- Are Timed Automata Updatable?.- Tuning SAT Checkers for Bounded Model Checking.- Unfoldings of Unbounded Petri Nets.- Verification Diagrams Revisited: Disjunctive Invariants for Easy Verification.- Verifying Advanced Microarchitectures that Support Speculation and Exceptions.- Tool Papers.- FoCs – Automatic Generation of Simulation Checkers from Formal Specifications.- IF: A Validation Environment for Timed Asynchronous Systems.- Integrating WS1S with PVS.- PET: An Interactive Software Testing Tool.- A Proof-Carrying Code Architecture for Java.- The Statemate Verification Environment.- TAPS: A First-Order Verifier for Cryptographic Protocols.- VINAS-P: A Tool for TraceTheoretic Verification of Timed Asynchronous Circuits.- XMC: A Logic-Programming-Based Verification Toolset.
Caracteristici
Includes supplementary material: sn.pub/extras