Conferences in DBLP

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

1. Aske Simon Christensen, Anders Møller, Michael I. Schwartzbach
   Precise Analysis of String Expressions. [Citation Graph (0, 0)][DBLP]
   SAS, 2003, pp:1-18 [Conf]
   
2. Frédéric Besson, Thomas P. Jensen
   Modular Class Analysis with DATALOG. [Citation Graph (0, 0)][DBLP]
   SAS, 2003, pp:19-36 [Conf]
   
3. Francesco Logozzo
   Class-Level Modular Analysis for Object Oriented Languages. [Citation Graph (0, 0)][DBLP]
   SAS, 2003, pp:37-54 [Conf]
   
4. John Boyland
   Checking Interference with Fractional Permissions. [Citation Graph (0, 0)][DBLP]
   SAS, 2003, pp:55-72 [Conf]
   
5. Richard Carlsson, Konstantinos F. Sagonas, Jesper Wilhelmsson
   Message Analysis for Concurrent Languages. [Citation Graph (0, 0)][DBLP]
   SAS, 2003, pp:73-90 [Conf]
   
6. Olivier Tardieu, Robert de Simone
   Instantaneous Termination in Pure Esterel. [Citation Graph (0, 0)][DBLP]
   SAS, 2003, pp:91-108 [Conf]
   
7. Krishnendu Chatterjee, Di Ma, Rupak Majumdar, Tian Zhao, Thomas A. Henzinger, Jens Palsberg
   Stack Size Analysis for Interrupt-Driven Programs. [Citation Graph (0, 0)][DBLP]
   SAS, 2003, pp:109-126 [Conf]
   
8. Manuel V. Hermenegildo, Germán Puebla, Francisco Bueno, Pedro López-García
   Program Development Using Abstract Interpretation (And The Ciao System Preprocessor). [Citation Graph (0, 0)][DBLP]
   SAS, 2003, pp:127-152 [Conf]
   
9. Yasuhiko Minamide
   Selective Tail Call Elimination. [Citation Graph (0, 0)][DBLP]
   SAS, 2003, pp:153-170 [Conf]
   
10. Oukseh Lee, Hongseok Yang, Kwangkeun Yi
    Inserting Safe Memory Reuse Commands into ML-Like Programs. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:171-188 [Conf]
    
11. Thomas W. Reps, Stefan Schwoon, Somesh Jha
    Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:189-213 [Conf]
    
12. Samuel Z. Guyer, Calvin Lin
    Client-Driven Pointer Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:214-236 [Conf]
    
13. David Monniaux
    Abstract Interpretation of Programs as Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:237-254 [Conf]
    
14. Paolo Baldan, Barbara König, Bernhard König
    A Logic for Analyzing Abstractions of Graph Transformation Systems. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:255-272 [Conf]
    
15. Ben Liblit, Alexander Aiken, Katherine A. Yelick
    Type Systems for Distributed Data Sharing. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:273-294 [Conf]
    
16. Ted Kremenek, Dawson R. Engler
    Z-Ranking: Using Statistical Analysis to Counter the Impact of Static Analysis Approximations. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:295-315 [Conf]
    
17. Martín Abadi, Bruno Blanchet
    Computer-Assisted Verification of a Protocol for Certified Email. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:316-335 [Conf]
    
18. Kenneth L. McMillan
    Craig Interpolation and Reachability Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:336- [Conf]
    
19. Roberto Bagnara, Patricia M. Hill, Elisa Ricci, Enea Zaffanella
    Precise Widening Operators for Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:337-354 [Conf]
    
20. Nicolas Halbwachs, David Merchat, Catherine Parent-Vigouroux
    Cartesian Factoring of Polyhedra in Linear Relation Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:355-365 [Conf]
    
21. Peter Thiemann
    Continuation-Based Partial Evaluation without Continuations. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:366-382 [Conf]
    
22. Priya Unnikrishnan, Guangyu Chen, Mahmut T. Kandemir, Mustafa Karaköy, Ibrahim Kolcu
    Loop Transformations for Reducing Data Space Requirements of Resource-Constrained Applications. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:383-400 [Conf]
    
23. Wen-Ke Chen, Bengu Li, Rajiv Gupta
    Code Compaction of Matching Single-Entry Multiple-Exit Regions. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:401-417 [Conf]
    
24. Viktor Kuncak, Martin C. Rinard
    Existential Heap Abstraction Entailment Is Undecidable. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:418-438 [Conf]
    
25. John Field, Deepak Goyal, G. Ramalingam, Eran Yahav
    Typestate Verification: Abstraction Techniques and Complexity Results. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:439-462 [Conf]
    
26. Stephen Chong, Radu Rugina
    Static Analysis of Accessed Regions in Recursive Data Structures. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:463-482 [Conf]
    
27. Ran Shaham, Eran Yahav, Elliot K. Kolodner, Shmuel Sagiv
    Establishing Local Temporal Heap Safety Properties with Applications to Compile-Time Memory Management. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:483-503 [Conf]