Static Analysis 11th International Symposium, SAS 2004, Verona, Italy, August 26-28, 2004, Proceedings /
Static Analysis 11th International Symposium, SAS 2004, Verona, Italy, August 26-28, 2004, Proceedings / [electronic resource] :
edited by Roberto Giacobazzi.
- 1st ed. 2004.
- XII, 396 p. online resource.
- Lecture Notes in Computer Science, 3148 1611-3349 ; .
- Lecture Notes in Computer Science, 3148 .
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.
9783540278641
10.1007/b99688 doi
Software engineering.
Compilers (Computer programs).
Computer science.
Machine theory.
Computer programming.
Software Engineering.
Compilers and Interpreters.
Computer Science Logic and Foundations of Programming.
Formal Languages and Automata Theory.
Programming Techniques.
QA76.758
005.1
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.
9783540278641
10.1007/b99688 doi
Software engineering.
Compilers (Computer programs).
Computer science.
Machine theory.
Computer programming.
Software Engineering.
Compilers and Interpreters.
Computer Science Logic and Foundations of Programming.
Formal Languages and Automata Theory.
Programming Techniques.
QA76.758
005.1