Conferences in DBLP

Static Analysis (WSA/SAS) (sas)
1994 (conf/sas/94)

1. Thomas W. Getzinger
   The Costs and Benefits of Abstract Interpretation-driven Prolog Optimization [Citation Graph (0, 0)][DBLP]
   SAS, 1994, pp:1-25 [Conf]
   
2. Michael Hanus, Frank Zartmann
   Mode Analysis of Functional Logic Programs [Citation Graph (0, 0)][DBLP]
   SAS, 1994, pp:26-42 [Conf]
   
3. Alexander Aiken, T. K. Lakshman
   Directional Type Checking of Logic Programs [Citation Graph (0, 0)][DBLP]
   SAS, 1994, pp:43-60 [Conf]
   
4. Dmitri Boulanger, Maurice Bruynooghe
   A Systematic Construction of Abstract Domains [Citation Graph (0, 0)][DBLP]
   SAS, 1994, pp:61-77 [Conf]
   
5. Ole Agesen
   Constraint-Based Type Inference and Parametric Polymorphism. [Citation Graph (0, 0)][DBLP]
   SAS, 1994, pp:78-100 [Conf]
   
6. Frank Mueller, David B. Whalley
   Efficient On-the-fly Analysis of Program Behavior and Static Cache Simulation. [Citation Graph (0, 0)][DBLP]
   SAS, 1994, pp:101-115 [Conf]
   
7. Edwin A. Harcourt, Jon Mauney, Todd A. Cook
   From Processor Timing Specifications to Static Intruction Scheduling. [Citation Graph (0, 0)][DBLP]
   SAS, 1994, pp:116-130 [Conf]
   
8. Anindya Banerjee, David A. Schmidt
   Stackability in the Simply-Typed Call-by-Value Lambda Calculus. [Citation Graph (0, 0)][DBLP]
   SAS, 1994, pp:131-146 [Conf]
   
9. Jean Goubault
   Generalized Boxings, Congruences and Partial Inlining. [Citation Graph (0, 0)][DBLP]
   SAS, 1994, pp:147-161 [Conf]
   
10. Paul Steckler, Mitchell Wand
    Selective Thunkification. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:162-178 [Conf]
    
11. Nicolas Halbwachs
    About Synchronous Programming and Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:179-192 [Conf]
    
12. David A. Garza-Salazar, A. P. Wim Böhm
    Uniqueness and Completeness Analysis of Array Comprehensions. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:193-207 [Conf]
    
13. Björn Lisper, Jean-Francois Collard
    Extended Analysis of Data Fields. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:208-222 [Conf]
    
14. Nicolas Halbwachs, Yann-Eric Proy, Pascal Raymond
    Verification of Linear Hybrid Systems by Means of Convex Approximations. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:223-237 [Conf]
    
15. Kwangkeun Yi
    Compile-time Detection of Uncaught Exceptions in Standard ML Programs. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:238-254 [Conf]
    
16. Kristian Damm Jensen, Peter Hjæresen, Mads Rosendahl
    Efficient Strictness Analysis of Haskell. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:246-362 [Conf]
    
17. Saumya K. Debray, Pedro López-García, Manuel V. Hermenegildo, Nai-Wei Lin
    Estimating the Computational Cost of Logic Programs. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:255-265 [Conf]
    
18. Tania Armstrong, Kim Marriott, Peter Schachte, Harald Søndergaard
    Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:266-280 [Conf]
    
19. Michael Codish, Bart Demoen
    Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:281-296 [Conf]
    
20. Daniel Cabeza Gras, Manuel V. Hermenegildo
    Extracting Non-Strict Independent And-Parallelism Using Sharing and Freeness Information. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:297-313 [Conf]
    
21. Bart Vergauwen, J. Wauman, Johan Lewi
    Efficient FixPoint Computation. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:314-328 [Conf]
    
22. Niels Jörgensen
    Finding Fixpoints in Finite Function Spaces Using Neddedness Analysis and Chaotic Iteration. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:329-345 [Conf]
    
23. Laurent Mauborgne
    Abstract Interpretation Using TDGs. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:363-379 [Conf]
    
24. Chris Hankin, Daniel Le Métayer
    A Type-based Framework for Program Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:380-394 [Conf]
    
25. Fritz Henglein
    Iterative Fixed Point Computation for Type-Based Strictness Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:395-407 [Conf]
    
26. Kirsten Lackner Solberg
    Strictness and Totality Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:408-422 [Conf]
    
27. Charles Consel
    Fast Strictness Analysis Via Symbolic Fixpoint Iteration. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:423-431 [Conf]
    
28. Robert Glück, Jesper Jørgensen
    Generating Transformers for Deforestation and Supercompilation. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:432-448 [Conf]
    
29. Hessam Khoshnevisan, Mohamad Afshar
    Mechanical Elimination of Commutative Redundancy. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:449-463 [Conf]