Computer Aided Verification: 16th International Conference, CAV 2004, Boston, MA, USA, July 13-17, 2004, Proceedings: Lecture Notes in Computer Science, cartea 3114
Editat de Rajeev Alur, Doron A. Peleden Limba Engleză Paperback – 29 iun 2004
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 340.32 lei
- 20% Preț: 341.95 lei
- 20% Preț: 453.32 lei
- 20% Preț: 238.01 lei
- 20% Preț: 340.32 lei
- 20% Preț: 438.69 lei
- Preț: 449.57 lei
- 20% Preț: 343.62 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 645.28 lei
- 17% Preț: 427.22 lei
- 20% Preț: 655.02 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 591.51 lei
- Preț: 381.21 lei
- 20% Preț: 337.00 lei
- 15% Preț: 438.59 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 575.48 lei
- 20% Preț: 583.40 lei
- 20% Preț: 763.23 lei
- 15% Preț: 580.46 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 353.50 lei
- 20% Preț: 585.88 lei
- Preț: 410.88 lei
- 20% Preț: 596.46 lei
- 20% Preț: 763.23 lei
- 20% Preț: 825.93 lei
- 20% Preț: 649.49 lei
- 20% Preț: 350.21 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 659.83 lei
Preț vechi: 824.79 lei
-20% Nou
Puncte Express: 990
Preț estimativ în valută:
126.32€ • 129.98$ • 106.48£
126.32€ • 129.98$ • 106.48£
Carte tipărită la comandă
Livrare economică 01-15 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540223429
ISBN-10: 3540223428
Pagini: 552
Ilustrații: XII, 536 p.
Dimensiuni: 155 x 233 x 29 mm
Greutate: 0.81 kg
Ediția:2004
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540223428
Pagini: 552
Ilustrații: XII, 536 p.
Dimensiuni: 155 x 233 x 29 mm
Greutate: 0.81 kg
Ediția:2004
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Rob Tristan Gerth: 1956–2003.- Static Program Analysis via 3-Valued Logic.- Deductive Verification of Pipelined Machines Using First-Order Quantification.- A Formal Reduction for Lock-Free Parallel Algorithms.- An Efficiently Checkable, Proof-Based Formulation of Vacuity in Model Checking.- Termination of Linear Programs.- Symbolic Model Checking of Non-regular Properties.- Proving More Properties with Bounded Model Checking.- Parallel LTL-X Model Checking of High-Level Petri Nets Based on Unfoldings.- Using Interface Refinement to Integrate Formal Verification into the Design Cycle.- Indexed Predicate Discovery for Unbounded System Verification.- Range Allocation for Separation Logic.- An Experimental Evaluation of Ground Decision Procedures.- DPLL(T): Fast Decision Procedures.- Verifying ?-Regular Properties of Markov Chains.- Statistical Model Checking of Black-Box Probabilistic Systems.- Compositional Specification and Model Checking in GSTE.- GSTE Is Partitioned Model Checking.- Stuck-Free Conformance.- Symbolic Simulation, Model Checking and Abstraction with Partially Ordered Boolean Functional Vectors.- Functional Dependency for Verification Reduction.- Verification via Structure Simulation.- Symbolic Parametric Safety Analysis of Linear Hybrid Systems with BDD-Like Data-Structures.- Abstraction-Based Satisfiability Solving of Presburger Arithmetic.- Widening Arithmetic Automata.- Why Model Checking Can Improve WCET Analysis.- Regular Model Checking for LTL(MSO).- Image Computation in Infinite State Model Checking.- Abstract Regular Model Checking.- Global Model-Checking of Infinite-State Systems.- QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings.- Verification of an Advanced mips-Type Out-of-Order Execution Algorithm.- Automatic Verification of Sequential Consistency for Unbounded Addresses and Data Values.- Efficient Modeling of Embedded Memories in Bounded Model Checking.- Understanding Counterexamples with explain.- Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement.- JNuke: Efficient Dynamic Analysis for Java.- The HiVy Tool Set.- ObsSlice: A Timed Automata Slicer Based on Observers.- The UCLID Decision Procedure.- MCK: Model Checking the Logic of Knowledge.- Zing: A Model Checker for Concurrent Software.- The Mec 5 Model-Checker.- PlayGame: A Platform for Diagnostic Games.- SAL 2.- Formal Analysis of Java Programs in JavaFAN.- A Toolset for Modelling and Verification of GALS Systems.- WSAT: A Tool for Formal Analysis of Web Services.- CVC Lite: A New Implementation of the Cooperating Validity Checker.- CirCUs: A Satisfiability Solver Geared towards Bounded Model Checking.- Mechanical Mathematical Methods for Microprocessor Verification.
Caracteristici
Includes supplementary material: sn.pub/extras