Verification, Model Checking, and Abstract Interpretation
Editat de Lenore D. Zuck, Paul D. Attie, Agostino Cortesi, Supratik Mukhopadhyayen Limba Engleză Paperback – 13 dec 2002
Preț: 323.23 lei
Preț vechi: 404.04 lei
-20% Nou
Puncte Express: 485
Preț estimativ în valută:
57.19€ • 66.63$ • 49.94£
57.19€ • 66.63$ • 49.94£
Carte tipărită la comandă
Livrare economică 17-31 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540003489
ISBN-10: 3540003487
Pagini: 340
Ilustrații: XII, 328 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.52 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540003487
Pagini: 340
Ilustrații: XII, 328 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.52 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Talks.- Software Model Checking with Abstraction Refinement.- Model-Checking and Abstraction to the Aid of Parameterized Systems.- Invited Tutorials.- Behavior-Based Model Construction.- Automatic Verification by Abstract Interpretation.- Symmetry Reductions in Model-Checking.- Static Analysis.- CHASE:A Static Checker for JML’s Assignable Clause.- Abstract Interpretation-Based Certification of Assembly Code.- Property Checking Driven Abstract Interpretation-Based Static Analysis.- Optimized Live Heap Bound Analysis.- Dynamic Systems.- Complexity of Nesting Analysis in Mobile Ambients.- Types for Evolving Communication in Safe Ambients.- A Logical Encoding of the ?-Calculus: Model Checking Mobile Processes Using Tabled Resolution.- Abstract Interpretation.- Properties of a Type Abstract Interpreter.- Domain Compression for Complete Abstractions.- Abstraction of Expectation Functions Using Gaussian Distributions.- Model Checking I.- Lifting Temporal Proofs through Abstractions.- Efficient Verification of Timed Automata with BDD-Like Data-Structures.- On the Expressiveness of 3-Valued Models.- Security Protocols.- Bisimulation and Unwinding for Verifying Possibilistic Security Properties.- Formal Verification of the Horn-Preneel Micropayment Protocol.- Formal Methods.- Action Refinement from a Logical Point of View.- Reasoning about Layered Message Passing Systems.- Using Simulated Execution in Verifying Distributed Algorithms.- Model Checking II.- Efficient Computation of Recurrence Diameters.- Shape Analysis through Predicate Abstraction and Model Checking.
Caracteristici
Includes supplementary material: sn.pub/extras