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ț: 426.75 lei - 20%
Preț: 315.62 lei - 20%
Preț: 320.92 lei - 15%
Preț: 426.53 lei - 20%
Preț: 313.87 lei - 20%
Preț: 355.79 lei - 20%
Preț: 355.54 lei - 20%
Preț: 355.18 lei - 20%
Preț: 390.68 lei - 20%
Preț: 392.03 lei - 20%
Preț: 498.95 lei - 20%
Preț: 390.79 lei - 20%
Preț: 495.44 lei - 20%
Preț: 498.80 lei - 20%
Preț: 498.50 lei - 20%
Preț: 355.93 lei - 20%
Preț: 639.52 lei - 20%
Preț: 499.90 lei - 20%
Preț: 498.95 lei - 20%
Preț: 270.68 lei - 20%
Preț: 321.68 lei - 20%
Preț: 391.36 lei - 20%
Preț: 322.09 lei - 20%
Preț: 498.90 lei - 20%
Preț: 312.82 lei - 20%
Preț: 496.73 lei - 20%
Preț: 463.03 lei - 20%
Preț: 531.75 lei - 15%
Preț: 496.40 lei - 20%
Preț: 497.25 lei - 20%
Preț: 498.80 lei - 20%
Preț: 461.86 lei - 20%
Preț: 355.59 lei - 20%
Preț: 324.19 lei -
Preț: 418.19 lei - 20%
Preț: 498.59 lei - 20%
Preț: 391.28 lei - 20%
Preț: 355.69 lei - 15%
Preț: 499.72 lei - 20%
Preț: 499.40 lei - 20%
Preț: 390.42 lei - 20%
Preț: 497.75 lei - 20%
Preț: 326.81 lei - 20%
Preț: 322.32 lei - 20%
Preț: 390.42 lei - 20%
Preț: 458.84 lei - 20%
Preț: 427.09 lei - 20%
Preț: 499.90 lei - 20%
Preț: 320.72 lei
Preț: 634.94 lei
Preț vechi: 793.68 lei
-20% Nou
Puncte Express: 952
Preț estimativ în valută:
112.36€ • 131.03$ • 98.65£
112.36€ • 131.03$ • 98.65£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
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