Computer Aided Verification: 19th International Conference, CAV 2007, Berlin, Germany, July 3-7, 2007, Proceedings: Lecture Notes in Computer Science, cartea 4590
Editat de Werner Damm, Holger Hermannsen Limba Engleză Paperback – 2 iul 2007
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ț: 344.34 lei
Preț vechi: 430.42 lei
-20% Nou
Puncte Express: 517
Preț estimativ în valută:
65.92€ • 68.52$ • 54.66£
65.92€ • 68.52$ • 54.66£
Carte tipărită la comandă
Livrare economică 06-20 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540733676
ISBN-10: 3540733671
Pagini: 584
Ilustrații: XV, 562 p.
Dimensiuni: 155 x 235 x 31 mm
Greutate: 0.91 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540733671
Pagini: 584
Ilustrații: XV, 562 p.
Dimensiuni: 155 x 235 x 31 mm
Greutate: 0.91 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Talks.- Automatically Proving Program Termination.- A Mathematical Approach to RTL Verification.- Software Bugs Seen from an Industrial Perspective or Can Formal Methods Help on Automotive Software Development?.- Invited Tutorials.- Algorithms for Interface Synthesis.- A Tutorial on Satisfiability Modulo Theories.- A JML Tutorial: Modular Specification and Verification of Functional Behavior for Java.- Verification of Hybrid Systems.- Session I: Compositionality.- SAT-Based Compositional Verification Using Lazy Learning.- Local Proofs for Global Safety Properties.- Session II: Verification Process.- Low-Level Library Analysis and Summarization.- Verification Across Intellectual Property Boundaries.- Session III: Timed Synthesis and Games.- On Synthesizing Controllers from Bounded-Response Properties.- An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games.- UPPAAL-Tiga: Time for Playing Games!.- The TASM Toolset: Specification, Simulation, and Formal Verification of Real-Time Systems.- Session IV: Infinitive State Verification.- Systematic Acceleration in Regular Model Checking.- Parameterized Verification of Infinite-State Processes with Global Conditions.- Session V: Tool Environment.- CADP 2006: A Toolbox for the Construction and Analysis of Distributed Processes.- jMoped: A Test Environment for Java Programs.- Hector: Software Model Checking with Cooperating Analysis Plugins.- The Why/Krakatoa/Caduceus Platform for Deductive Program Verification.- Session VI: Shapes.- Shape Analysis for Composite Data Structures.- Array Abstractions from Proofs.- Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures.- Revamping TVLA: Making Parametric Shape Analysis Competitive.- Session VII: Concurrent Program Verification.- Fast and Accurate Static Data-Race Detection for Concurrent Programs.- Parametric and Sliced Causality.- Spade: Verification of Multithreaded Dynamic and Recursive Programs.- Session VIII: Reactive Designs.- Anzu: A Tool for Property Synthesis.- RAT: A Tool for the Formal Analysis of Requirements.- Session IX: Parallelisation.- Parallelising Symbolic State-Space Generators.- I/O Efficient Accepting Cycle Detection.- Session X: Constraints and Decisions.- C32SAT: Checking C Expressions.- CVC3.- BAT: The Bit-Level Analysis Tool.- LIRA: Handling Constraints of Linear Arithmetics over the Integers and the Reals.- Session XI: Probabilistic Verification.- Three-Valued Abstraction for Continuous-Time Markov Chains.- Magnifying-Lens Abstraction for Markov Decision Processes.- Underapproximation for Model-Checking Based on Random Cryptographic Constructions.- Session XII: Abstraction.- Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra.- Structural Abstraction of Software Verification Conditions.- An Abstract Domain for Analyzing Heap-Manipulating Low-Level Software.- Adaptive Symmetry Reduction.- Session XIII: Assume-Guarantee Reasoning.-From Liveness to Promptness.- Automated Assumption Generation for Compositional Verification.- Session XIV: Hybrid Systems.- Abstraction and Counterexample-Guided Construction of ?-Automata for Model Checking of Step-Discrete Linear Hybrid Models.- Test Coverage for Continuous and Hybrid Systems.- Hybrid Systems: From Verification to Falsification.- Session XV: Program Analysis.- Comparison Under Abstraction for Verifying Linearizability.- Leaping Loops in the Presence of Abstraction.- Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis.- Session XVI: SAT and Decision Procedures.- A Decision Procedure for Bit-Vectors and Arrays.- Boolean Abstraction for Temporal Logic Satisfiability.- A Lazy and Layered SMT( ) Solver for Hard Industrial Verification Problems.