Static Analysis 13th International Symposium, SAS 2006, Seoul, Korea, August 29-31, 2006. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Yi, Kwangkeun (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006.
Σειρά:Lecture Notes in Computer Science, 4134
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
Πίνακας περιεχομένων:
  • Invited Talk
  • Unleashing the Power of Static Analysis
  • Session 1
  • Static Analysis in Disjunctive Numerical Domains
  • Static Analysis of Numerical Algorithms
  • Static Analysis of String Manipulations in Critical Embedded C Programs
  • Session 2
  • Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
  • Structural Invariants
  • Existential Label Flow Inference Via CFL Reachability
  • Session 3
  • Abstract Interpretation with Specialized Definitions
  • Underapproximating Predicate Transformers
  • Combining Widening and Acceleration in Linear Relation Analysis
  • Beyond Iteration Vectors: Instancewise Relational Abstract Domains
  • Invited Talk
  • Separation Logic and Program Analysis
  • Beyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic
  • Session 4
  • Specialized 3-Valued Logic Shape Analysis Using Structure-Based Refinement and Loose Embedding
  • Recency-Abstraction for Heap-Allocated Storage
  • Interprocedural Shape Analysis with Separated Heap Abstractions
  • Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm
  • Invited Talk
  • Shape Analysis for Low-Level Code
  • Session 5
  • Catching and Identifying Bugs in Register Allocation
  • Certificate Translation for Optimizing Compilers
  • Analysis of Low-Level Code Using Cooperating Decompilers
  • Session 6
  • Static Analysis for Java Servlets and JSP
  • Cryptographically-Masked Flows
  • Proving the Properties of Communicating Imperfectly-Clocked Synchronous Systems
  • Session 7
  • Parametric and Termination-Sensitive Control Dependence
  • Memory Leak Analysis by Contradiction
  • Path-Sensitive Dataflow Analysis with Iterative Refinement.