Static Analysis 11th International Symposium, SAS 2004, Verona, Italy, August 26-28, 2004. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Giacobazzi, Roberto (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2004.
• Σειρά: Lecture Notes in Computer Science, 3148
• Θέματα: Computer science.; Software engineering.; Computer programming.; Programming languages (Electronic computers).; Computer logic.; Mathematical logic.; Computer Science.; Software Engineering/Programming and Operating Systems.; Programming Languages, Compilers, Interpreters.; Logics and Meanings of Programs.; Software Engineering.; Mathematical Logic and Formal Languages.; Programming Techniques.

Πίνακας περιεχομένων:

• 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.