12. SAS 2005:
London,
UK
Chris Hankin, Igor Siveroni (Eds.):
Static Analysis, 12th International Symposium, SAS 2005, London, UK, September 7-9, 2005, Proceedings.
Lecture Notes in Computer Science 3672 Springer 2005, ISBN 3-540-28584-9 
Invited Talks
Contributed Papers
- Roberto Bagnara, Patricia M. Hill, Elena Mazzi, Enea Zaffanella:
Widening Operators for Weakly-Relational Numeric Abstractions.
3-18
- Roberto Bagnara, Enric Rodríguez-Carbonell, Enea Zaffanella:
Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra.
19-34
- Maurice Bruynooghe, John P. Gallagher, Wouter Van Humbeeck:
Inference of Well-Typings for Logic Programs with Application to Termination Analysis.
35-51
- Guilin Chen, Mahmut T. Kandemir, Mustafa Karaköy:
Memory Space Conscious Loop Iteration Duplication for Reliable Execution.
52-69
- Wei-Ngan Chin, Huu Hai Nguyen, Shengchao Qin, Martin C. Rinard:
Memory Usage Verification for OO Programs.
70-86
- Byron Cook, Andreas Podelski, Andrey Rybalchenko:
Abstraction Refinement for Termination.
87-101
- Aleksandar Dimovski, Dan R. Ghica, Ranko Lazic:
Data-Abstraction Refinement: A Game Semantic Approach.
102-117
- Javier Esparza, Pierre Ganty, Stefan Schwoon:
Locality-Based Abstractions.
118-134
- Neal Glew, Jens Palsberg, Christian Grothoff:
Type-Safe Optimisation of Plugin Architectures.
135-154
- Matthew Harren, George C. Necula:
Using Dependent Types to Certify the Safety of Assembly Code.
155-170
- Sebastian Hunt, Isabella Mastroeni:
The PER Model of Abstract Non-interference.
171-185
- Bertrand Jeannet, Denis Gopan, Thomas W. Reps:
A Relational Abstraction for Functions.
186-202
- Yungbum Jung, Jaehwang Kim, Jaeho Shin, Kwangkeun Yi:
Taming False Alarms from a Domain-Unaware C Analyzer by a Bayesian Statistical Post Analysis.
203-217
- John Kodumal, Alexander Aiken:
Banshee: A Scalable Constraint-Based Analysis Toolkit.
218-234
- Markus Müller-Olm, Helmut Seidl:
A Generic Framework for Interprocedural Analysis of Numerical Properties.
235-250
- Iman Narasamdya, Andrei Voronkov:
Finding Basic Block and Variable Correspondence.
251-267
- Andreas Podelski, Thomas Wies:
Boolean Heaps.
268-283
- Noam Rinetzky, Mooly Sagiv, Eran Yahav:
Interprocedural Shape Analysis for Cutpoint-Free Programs.
284-302
- Xavier Rival:
Understanding the Origin of Alarms in Astrée.
303-319
- Stefano Secci, Fausto Spoto:
Pair-Sharing Analysis of Object-Oriented Programs.
320-335
- Axel Simon, Andy King:
Exploiting Sparsity in Polyhedral Analysis.
336-351
- Tachio Terauchi, Alexander Aiken:
Secure Information Flow as a Safety Problem.
352-367
Last update Thu May 24 04:41:55 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
