The SCEAS System
Navigation Menu

Conferences in DBLP

Static Analysis (WSA/SAS) (sas)
1995 (conf/sas/95)

  1. David A. Schmidt
    Natural-Semantics-Based Abstract Interpretation (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:1-18 [Conf]
  2. Mads Tofte
    Region Inference for Higher-Order Functional Languages [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:19-20 [Conf]
  3. Pierre Wolper, Bernard Boigelot
    An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:21-32 [Conf]
  4. Martin Alt, Florian Martin
    Generation of Efficient Interprocedural Analyzers with PAG [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:33-50 [Conf]
  5. Rance Cleaveland, S. Purushothaman Iyer, Daniel Yankelevich
    Optimality in Abstractions of Model Checking [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:51-63 [Conf]
  6. Christopher Colby
    Determining Storage Properties of Sequential and Concurrent Programs with Assignment and Structured Data [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:64-81 [Conf]
  7. Satyan R. Coorg
    Partitioning Non-strict Functional Languages for Multi-threaded Code Generation [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:82-99 [Conf]
  8. Agostino Cortesi, Gilberto Filé, Roberto Giacobazzi, Catuscia Palamidessi, Francesco Ranzato
    Complementation in Abstract Interpretation [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:100-117 [Conf]
  9. Dirk Dussart, Fritz Henglein, Christian Mossin
    Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:118-135 [Conf]
  10. Karl-Filip Faxén
    Optimizing Lazy Functional Programs Using Flow Inference [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:136-153 [Conf]
  11. Jürgen Giesl
    Termination Analysis for Functional Programs using Term Orderings [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:154-171 [Conf]
  12. John Hannan
    A Type-based Analysis for Stack Allocation in Functional Languages [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:172-188 [Conf]
  13. Nevin Heintze
    Control-Flow Analysis and Type Systems [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:189-206 [Conf]
  14. Suresh Jagannathan, Andrew K. Wright
    Effective Flow Analysis for Avoiding Run-Time Checks [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:207-224 [Conf]
  15. Naoki Kobayashi, Motoki Nakade, Akinori Yonezawa
    Static Analysis of Communication for Asynchronous Concurrent Programming Languages [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:225-242 [Conf]
  16. M. R. K. Krishna Rao, R. K. Shyamasundar
    Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:243-260 [Conf]
  17. Markus Mohnen
    Efficient Closure Utilisation by Higher-Order Inheritance Analysis [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:261-278 [Conf]
  18. Bruno Monsuez
    System F and Abstract Interpretation [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:279-295 [Conf]
  19. Kristian Nielsen, Morten Heine Sørensen
    Call-By-Name CPS-Translation as a Binding-Time Improvement [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:296-313 [Conf]
  20. Jens Palsberg, Peter Ørbæk
    Trust in the lambda-Calculus [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:314-329 [Conf]
  21. Viswanath Ramachandran, Pascal Van Hentenryck
    LSign Reordered [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:330-347 [Conf]
  22. Manfred Schmidt-Schauß, Sven Eric Panitz, Marko Schütz
    Abstract Reduction Using a Tableau Calculus [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:348-365 [Conf]
  23. Manuel Serrano, Pierre Weis
    Bigloo: A Portable and Optimizing Compiler for Strict Functional Languages [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:366-381 [Conf]
  24. Julian Seward
    Beyond Prototype Implementations: Polymorphic Projection Analysis for Glasgow Haskell [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:382-399 [Conf]
  25. Franck Védrine
    Binding-Time Analysis and Strictness Analysis by Abstract Interpretation [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:400-417 [Conf]
  26. Christian Fecht
    GENA - A Tool for Generating Prolog Analyzers from Specifications [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:418-419 [Conf]
  27. Magnus Nordin, Thomas Lindgren, Håkan Millroth
    IGOR: A Tool for Developing Prolog Dataflow Analyzers [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:420-421 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002