Conferences in DBLP

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

1. John Hatcliff, James C. Corbett, Matthew B. Dwyer, Stefan Sokolowski, Hongjun Zheng
   A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives. [Citation Graph (0, 0)][DBLP]
   SAS, 1999, pp:1-18 [Conf]
   
2. Jonathan Aldrich, Craig Chambers, Emin Gün Sirer, Susan J. Eggers
   Static Analyses for Eliminating Unnecessary Synchronization from Java Programs. [Citation Graph (0, 0)][DBLP]
   SAS, 1999, pp:19-38 [Conf]
   
3. Bertrand Jeannet, Nicolas Halbwachs, Pascal Raymond
   Dynamic Partitioning in Analyses of Numerical Properties. [Citation Graph (0, 0)][DBLP]
   SAS, 1999, pp:39-50 [Conf]
   
4. Frédéric Besson, Thomas P. Jensen, Jean-Pierre Talpin
   Polyhedral Analysis for Synchronous Languages. [Citation Graph (0, 0)][DBLP]
   SAS, 1999, pp:51-68 [Conf]
   
5. Enea Zaffanella, Patricia M. Hill, Roberto Bagnara
   Decomposing Non-redundant Sharing by Complementation. [Citation Graph (0, 0)][DBLP]
   SAS, 1999, pp:69-84 [Conf]
   
6. Patricia M. Hill, Fausto Spoto
   Freeness Analysis Through Linear Refinement. [Citation Graph (0, 0)][DBLP]
   SAS, 1999, pp:85-100 [Conf]
   
7. Laurent Mauborgne
   Binary Decision Graphs. [Citation Graph (0, 0)][DBLP]
   SAS, 1999, pp:101-116 [Conf]
   
8. Kenichi Asai
   Binding-Time Analysis for Both Static and Dynamic Expressions. [Citation Graph (0, 0)][DBLP]
   SAS, 1999, pp:117-133 [Conf]
   
9. René Rydhof Hansen, Jacob Grydholt Jensen, Flemming Nielson, Hanne Riis Nielson
   Abstract Interpretation of Mobile Ambients. [Citation Graph (0, 0)][DBLP]
   SAS, 1999, pp:134-148 [Conf]
   
10. David Monniaux
    Abstracting Cryptographic Protocols with Tree Automata. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:149-163 [Conf]
    
11. Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu
    State Space Reduction Based on Live Variables Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:164-178 [Conf]
    
12. Munehiro Takimoto, Kenichi Harada
    Partial Dead Code Elimination Using Extended Value Graph. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:179-193 [Conf]
    
13. Vugranam C. Sreedhar, Roy Dz-Ching Ju, David M. Gillies, Vatsa Santhanam
    Translating Out of Static Single Assignment Form. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:194-210 [Conf]
    
14. Yanhong A. Liu, Scott D. Stoller
    Eliminating Dead Code on Recursive Data. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:211-231 [Conf]
    
15. Oliver Rüthing, Jens Knoop, Bernhard Steffen
    Detecting Equalities of Variables: Combining Efficiency with Precision. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:232-247 [Conf]
    
16. Jörg Köller, Markus Mohnen
    A New Class of Functions for Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:248-263 [Conf]
    
17. Loïc Correnson, Étienne Duris, Didier Parigot, Gilles Roussel
    Equational Semantics. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:264-283 [Conf]
    
18. Dominique Cansell, Dominique Méry
    Abstract Animator for Temporal Specifications: Application to TLA. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:284-299 [Conf]
    
19. Daniel Weise
    Static Analysis of Mega-Programs. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:300-302 [Conf]
    
20. Dennis M. Volpano
    Safety versus Secrecy. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:303-311 [Conf]
    
21. David A. McAllester
    On the Complexity Analysis of Static Analyses. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:312-329 [Conf]
    
22. Markus Müller-Olm, David A. Schmidt, Bernhard Steffen
    Model-Checking: A Tutorial Introduction. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:330-354 [Conf]
    
23. Mary Lou Soffa
    Tutorial: Techniques to Improve the Scalability and Precision of Data Flow Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:355-356 [Conf]