Computer Aided Verification
Editat de Ed Brinksma, Kim G. Larsenen Limba Engleză Paperback – 19 iul 2002
Preț: 642.10 lei
Preț vechi: 802.63 lei
-20%
Puncte Express: 963
Carte tipărită la comandă
Livrare economică 28 iulie-11 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540439974
ISBN-10: 3540439978
Pagini: 656
Ilustrații: X, 362 p.
Dimensiuni: 155 x 235 x 36 mm
Greutate: 0.98 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540439978
Pagini: 656
Ilustrații: X, 362 p.
Dimensiuni: 155 x 235 x 36 mm
Greutate: 0.98 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Talks.- Software Analysis and Model Checking.- The Quest for Efficient Boolean Satisfiability Solvers.- Invited Tutorials.- On Abstraction in Software Verification.- The Symbolic Approach to Hybrid Systems.- Infinite Games and Verification.- Symbolic Model Checking.- Symbolic Localization Reduction with Reconstruction Layering and Backtracking.- Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions.- Combining Symmetry Reduction and Under-Approximation for Symbolic Model Checking.- Abstraction/Refinement and Model Checking.- Liveness with (0,1, ?)- Counter Abstraction.- Shared Memory Consistency Protocol Verification Against Weak Memory Models: Refinement via Model-Checking.- Automatic Abstraction Using Generalized Model Checking.- Compositional/Structural Verification.- Property Checking via Structural Analysis.- Conformance Checking for Models of Asynchronous Message Passing Software.- A Modular Checker for Multithreaded Programs.- Timing Analysis.- Automatic Derivation of Timing Constraints by Failure Analysis.- Deciding Separation Formulas with SAT.- Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling.- SAT Based Methods.- Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT.- Applying SAT Methods in Unbounded Symbolic Model Checking.- SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques.- Semi-formal Bounded Model Checking.- Symbolic Model Checking.- Algorithmic Verification of Invalidation-Based Protocols.- Formal Verification of Complex Out-of-Order Pipelines by Combining Model-Checking and Theorem-Proving.- Automated Unbounded Verification of Security Protocols.- Tool Presentations.- Exploiting Behavioral Hierarchy for Efficient Model Checking.- IF-2.0: A Validation Environment for Component-Based Real-Time Systems.- The AVISS Security Protocol Analysis Tool.- SPeeDI — A Verification Tool for Polygonal HybridSystems.- NuSMV 2: An OpenSource Tool for Symbolic Model Checking.- The d/dt Tool for Verification of Hybrid Systems.- Infinite Model Checking.- Model Checking Linear Properties of Prefix-Recognizable Systems.- Using Canonical Representations of Solutions to Speed Up Infinite-State Model Checking.- On Discrete Modeling and Model Checking for Nonlinear Analog Systems.- Compositional/Structural Verification.- Synchronous and Bidirectional Component Interfaces.- Interface Compatibility Checking for Software Modules.- Practical Methods for Proving Program Termination.- Extended Model Checking.- Evidence-Based Model Checking.- Mixing Forward and Backward Traversals in Guided-Prioritized BDD-Based Verification.- Vacuum Cleaning CTL Formulae.- Tool Presentations.- CVC: A Cooperating Validity Checker.- ?Chek: A Multi-valued Model-Checker.- PathFinder: A Tool for Design Exploration.- Abstracting C with abC.- AMC: An Adaptive Model Checker.- Code Verification.- Temporal-Safety Proofs for SystemsCode.- Regular Model Checking and Acceleration.- Extrapolating Tree Transformations.- Regular Tree Model Checking.- Compressing Transitions for Model Checking.- Model Reduction.- Canonical Prefixes of Petri Net Unfoldings.- State Space Reduction by Proving Confluence.- Fair Simulation Minimization.