Static Analysis 12th International Symposium, SAS 2005, London, UK, September 7-9, 2005, Proceedings / [electronic resource] :
edited by Chris Hankin, Igor Siveroni.
- 1st ed. 2005.
- X, 374 p. online resource.
- Programming and Software Engineering, 3672 2945-9168 ; .
- Programming and Software Engineering, 3672 .
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.
9783540319719
10.1007/11547662 doi
Software engineering.
Compilers (Computer programs).
Computer programming.
Computer science.
Machine theory.
Software Engineering.
Compilers and Interpreters.
Programming Techniques.
Computer Science Logic and Foundations of Programming.
Formal Languages and Automata Theory.
QA76.758
005.1
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.
9783540319719
10.1007/11547662 doi
Software engineering.
Compilers (Computer programs).
Computer programming.
Computer science.
Machine theory.
Software Engineering.
Compilers and Interpreters.
Programming Techniques.
Computer Science Logic and Foundations of Programming.
Formal Languages and Automata Theory.
QA76.758
005.1