Conferences in DBLP

Static Analysis (WSA/SAS) (sas)
2005 (conf/sas/2005)

1. Samson Abramsky
   Algorithmic Game Semantics and Static Analysis. [Citation Graph (0, 0)][DBLP]
   SAS, 2005, pp:1- [Conf]
   
2. Andrew D. Gordon
   From Typed Process Calculi to Source-Based Security. [Citation Graph (0, 0)][DBLP]
   SAS, 2005, pp:2- [Conf]
   
3. Roberto Bagnara, Patricia M. Hill, Elena Mazzi, Enea Zaffanella
   Widening Operators for Weakly-Relational Numeric Abstractions. [Citation Graph (0, 0)][DBLP]
   SAS, 2005, pp:3-18 [Conf]
   
4. Roberto Bagnara, Enric Rodríguez-Carbonell, Enea Zaffanella
   Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
   SAS, 2005, pp:19-34 [Conf]
   
5. Maurice Bruynooghe, John P. Gallagher, Wouter Van Humbeeck
   Inference of Well-Typings for Logic Programs with Application to Termination Analysis. [Citation Graph (0, 0)][DBLP]
   SAS, 2005, pp:35-51 [Conf]
   
6. Guilin Chen, Mahmut T. Kandemir, Mustafa Karaköy
   Memory Space Conscious Loop Iteration Duplication for Reliable Execution. [Citation Graph (0, 0)][DBLP]
   SAS, 2005, pp:52-69 [Conf]
   
7. Wei-Ngan Chin, Huu Hai Nguyen, Shengchao Qin, Martin C. Rinard
   Memory Usage Verification for OO Programs. [Citation Graph (0, 0)][DBLP]
   SAS, 2005, pp:70-86 [Conf]
   
8. Byron Cook, Andreas Podelski, Andrey Rybalchenko
   Abstraction Refinement for Termination. [Citation Graph (0, 0)][DBLP]
   SAS, 2005, pp:87-101 [Conf]
   
9. Aleksandar Dimovski, Dan R. Ghica, Ranko Lazic
   Data-Abstraction Refinement: A Game Semantic Approach. [Citation Graph (0, 0)][DBLP]
   SAS, 2005, pp:102-117 [Conf]
   
10. Javier Esparza, Pierre Ganty, Stefan Schwoon
    Locality-Based Abstractions. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:118-134 [Conf]
    
11. Neal Glew, Jens Palsberg, Christian Grothoff
    Type-Safe Optimisation of Plugin Architectures. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:135-154 [Conf]
    
12. Matthew Harren, George C. Necula
    Using Dependent Types to Certify the Safety of Assembly Code. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:155-170 [Conf]
    
13. Sebastian Hunt, Isabella Mastroeni
    The PER Model of Abstract Non-interference. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:171-185 [Conf]
    
14. Bertrand Jeannet, Denis Gopan, Thomas W. Reps
    A Relational Abstraction for Functions. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:186-202 [Conf]
    
15. Yungbum Jung, Jaehwang Kim, Jaeho Shin, Kwangkeun Yi
    Taming False Alarms from a Domain-Unaware C Analyzer by a Bayesian Statistical Post Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:203-217 [Conf]
    
16. John Kodumal, Alexander Aiken
    Banshee: A Scalable Constraint-Based Analysis Toolkit. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:218-234 [Conf]
    
17. Markus Müller-Olm, Helmut Seidl
    A Generic Framework for Interprocedural Analysis of Numerical Properties. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:235-250 [Conf]
    
18. Iman Narasamdya, Andrei Voronkov
    Finding Basic Block and Variable Correspondence. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:251-267 [Conf]
    
19. Andreas Podelski, Thomas Wies
    Boolean Heaps. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:268-283 [Conf]
    
20. Noam Rinetzky, Mooly Sagiv, Eran Yahav
    Interprocedural Shape Analysis for Cutpoint-Free Programs. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:284-302 [Conf]
    
21. Xavier Rival
    Understanding the Origin of Alarms in Astrée. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:303-319 [Conf]
    
22. Stefano Secci, Fausto Spoto
    Pair-Sharing Analysis of Object-Oriented Programs. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:320-335 [Conf]
    
23. Axel Simon, Andy King
    Exploiting Sparsity in Polyhedral Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:336-351 [Conf]
    
24. Tachio Terauchi, Alexander Aiken
    Secure Information Flow as a Safety Problem. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:352-367 [Conf]