The SCEAS System
Navigation Menu

Conferences in DBLP

Static Analysis (WSA/SAS) (sas)
1991 ()

  1. Christian Queinnec, Julian A. Padget
    A Proposal for a Modular Lisp with Macros and Dynamic Evaluation. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:1-8 [Conf]
  2. Vincent Dornic, Pierre Jouvelot, David K. Gifford
    Polymorphic Time Systems for Estimating Program Complexity. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:9-17 [Conf]
  3. Bruno Monsuez
    An Attempt to Find Polymorphic Types by Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:18-25 [Conf]
  4. Jean-Pierre Talpin, Pierre Jouvelot
    Polymorphic Type, Region and Effect Inference. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:26-32 [Conf]
  5. Patrick Cousot, Radhia Cousot
    Relational Abstract Interpretation of Higher Order Functional Programs (extended abstract). [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:33-36 [Conf]
  6. Pierre Crégut
    Interprétation abstraite pour améliorer la représentation des environnements dans les langages fonctionnels. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:37-43 [Conf]
  7. Yong Sun
    Equational Logics. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:44-52 [Conf]
  8. Rachid Echahed, Paul Jacquet, Marie-Laure Potet, Sadik Sebbar
    Equational Reasonning and the Completion Procedure. A Comparative Study in Program Transformation. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:53-61 [Conf]
  9. Christophe Lecoutre, Philippe Devienne, Patrick Lebègue
    Une analyse du comportement récursif de programmes Prolog par une interprétation abstraite. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:62-69 [Conf]
  10. Philippe Codognet, Gilberto Filé
    Computations, Abstractions and Constraints (abstract). [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:70-71 [Conf]
  11. Charles Consel, Siau-Cheng Khoo
    Evaluation partielle paramétrable. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:72-81 [Conf]
  12. Christopher Colby, Peter Lee
    An Implementation of Parametrized Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:82-89 [Conf]
  13. Anne De Niel, Eddi Bevers, Karel De Vlaminck
    Partial Evaluation of Polymorphically Typed Functional Languages: the Representation Problem. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:90-97 [Conf]
  14. Irène Durand, David Sherman, Robert Strandh
    Partial Evaluation of an Intermediate Language for Equational Programs. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:98-106 [Conf]
  15. Patrick Cousot, Radhia Cousot
    Comparison of the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:107-110 [Conf]
  16. Michel Billaud
    Axiomatizations of Backtracking. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:111-116 [Conf]
  17. Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi
    Modelling Prolog Control. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:117-124 [Conf]
  18. Frédéric Mesnard, Jean-Gabriel Ganascia
    A propos du contrôle de la résolution. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:125-131 [Conf]
  19. Anne Parrain, Philippe Devienne, Patrick Lebègue
    Techniques de transformations de programmes Prolog généraux et validation de méta-interpréteurs. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:132-138 [Conf]
  20. François Barthélemy
    Prédire à bon escient. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:139-143 [Conf]
  21. Kaninda Musumbu
    Interprétation abstraite au moyen de grammaires attribuées. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:144-150 [Conf]
  22. Eric Villemonte de la Clergerie
    A Tool for Abstract Interpretation: Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:151-156 [Conf]
  23. François Denis, Jean-Paul Delahaye
    Unfolding, Procedural and Fixpoint Semantics of Logic Programs. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:157-164 [Conf]
  24. Pierre De Boeck, Baudouin Le Charlier
    Automatic Construction of Prolog Primitives for Type Checking Analysis. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:165-172 [Conf]
  25. W.-N. Chin
    Generalising Deforestation for All First-Order Functional Programs. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:173-181 [Conf]
  26. Geoff W. Hamilton, S. B. Jones
    Transforming Programs to Eliminate Intermediate Structures. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:182-188 [Conf]
  27. Yamine Aït Ameur
    Non Functional Properties Can Guide Program Developments. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:189-196 [Conf]
  28. Olin Shivers
    Useless-Variable Elimination. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:197-201 [Conf]
  29. Peter T. Breuer
    An Analysis/Synthesis Language with Learning Strategies. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:202-209 [Conf]
  30. Jean-Louis Imbert, Pascal Van Hentenryck
    A propos des redondances dans les systèmes d'inéquations linéaires. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:210-216 [Conf]
  31. M. Griffiths, Pierre Massotte, C. Paul
    Analyse et transformation de programmes Prolog en vue de leur parallélisation avec les prédicats parand et paror. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:217-224 [Conf]
  32. F. Goudal
    Une représentation abstraite des expressions et continuations en Scheme. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:225-233 [Conf]
  33. Karoline Malmkjær
    On Static Properties of Specialized Programs. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:234-241 [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