Cantitate/Preț
Produs

Static Analysis

Editat de Roberto Giacobazzi
en Limba Engleză Paperback – 17 aug 2004

Preț: 32792 lei

Preț vechi: 40989 lei
-20%

Puncte Express: 492

Carte tipărită la comandă

Livrare economică 27 iulie-10 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei 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: 9783540227915
ISBN-10: 3540227911
Pagini: 412
Ilustrații: XII, 396 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:2004
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Invited Talks.- Injecting Life with Computers.- The Blast Query Language for Software Verification.- Program Generators and the Tools to Make Them.- Towards Declarative Programming for Web Services.- Program and System Verification.- Closed and Logical Relations for Over- and Under-Approximation of Powersets.- Completeness Refinement in Abstract Symbolic Trajectory Evaluation.- Constraint-Based Linear-Relations Analysis.- Spatial Analysis of BioAmbients.- Security and Safety.- Modular and Constraint-Based Information Flow Inference for an Object-Oriented Language.- Information Flow Analysis in Logical Form.- Type Inference Against Races.- Pointer Analysis.- Pointer-Range Analysis.- A Scalable Nonuniform Pointer Analysis for Embedded Programs.- Bottom-Up and Top-Down Context-Sensitive Summary-Based Pointer Analysis.- Abstract Interpretation and Algorithms.- Abstract Interpretation of Combinational Asynchronous Circuits.- Static Analysis of Gated Data Dependence Graphs.- A Polynomial-Time Algorithm for Global Value Numbering.- Shape Analysis.- Quantitative Shape Analysis.- A Relational Approach to Interprocedural Shape Analysis.- Partially Disjunctive Heap Abstraction.- Abstract Domain and Data Structures.- An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants.- Approximating the Algebraic Relational Semantics of Imperative Programs.- The Octahedron Abstract Domain.- Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions.- Shape Analysis and Logic.- On Logics of Aliasing.- Generalized Records and Spatial Conjunction in Role Logic.- Termination Analysis.- Non-termination Inference for Constraint Logic Programs.