Cantitate/Preț
Produs

Static Analysis: 11th International Symposium, SAS 2004, Verona, Italy, August 26-28, 2004, Proceedings: Lecture Notes in Computer Science, cartea 3148

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

Din seria Lecture Notes in Computer Science

Preț: 33137 lei

Preț vechi: 41421 lei
-20% Nou

Puncte Express: 497

Preț estimativ în valută:
6342 6587$ 5268£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540227915
ISBN-10: 3540227911
Pagini: 412
Ilustrații: XII, 396 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.58 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ă

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.

Caracteristici

Includes supplementary material: sn.pub/extras