Static Analysis 12th International Symposium, SAS 2005, London, UK, September 7-9, 2005. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Hankin, Chris (Επιμελητής έκδοσης), Siveroni, Igor (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
• Σειρά: Lecture Notes in Computer Science, 3672
• Θέματα: 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.; Programming Techniques.; Software Engineering.; Logics and Meanings of Programs.; Mathematical Logic and Formal Languages.

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

• Invited Talks
• Algorithmic Game Semantics and Static Analysis
• From Typed Process Calculi to Source-Based Security
• Contributed Papers
• Widening Operators for Weakly-Relational Numeric Abstractions
• Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra
• Inference of Well-Typings for Logic Programs with Application to Termination Analysis
• Memory Space Conscious Loop Iteration Duplication for Reliable Execution
• Memory Usage Verification for OO Programs
• Abstraction Refinement for Termination
• Data-Abstraction Refinement: A Game Semantic Approach
• Locality-Based Abstractions
• Type-Safe Optimisation of Plugin Architectures
• Using Dependent Types to Certify the Safety of Assembly Code
• The PER Model of Abstract Non-interference
• A Relational Abstraction for Functions
• Taming False Alarms from a Domain-Unaware C Analyzer by a Bayesian Statistical Post Analysis
• Banshee: A Scalable Constraint-Based Analysis Toolkit
• A Generic Framework for Interprocedural Analysis of Numerical Properties
• Finding Basic Block and Variable Correspondence
• Boolean Heaps
• Interprocedural Shape Analysis for Cutpoint-Free Programs
• Understanding the Origin of Alarms in Astrée
• Pair-Sharing Analysis of Object-Oriented Programs
• Exploiting Sparsity in Polyhedral Analysis
• Secure Information Flow as a Safety Problem.