The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Olivier Danvy, John Hatcliff
    Thunks (Continued). [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:3-11 [Conf]
  2. Chris Hankin, Daniel Le Métayer, David Sands
    Transformation of Gamma Programs. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:12-19 [Conf]
  3. Christian Queinnec
    Value Transforming Style. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:20-28 [Conf]
  4. Frédéric Mesnard, Marianne Morillon
    Automatic Generation of Valid Linear Measures for CLP(Q) Programs. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:29-34 [Conf]
  5. Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough
    Efficient Analysis of Reactive Properties of Concurrent Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:35-42 [Conf]
  6. Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
    Static Analysis of CLP Programs over Numeric Domains. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:43-50 [Conf]
  7. Marc-Michel Corsini, Kaninda Musumbu, Antoine Rauzy
    The Mu-Calculus over Finite Domains as an Abstract Semantics of Prolog. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:51-59 [Conf]
  8. Alan Mycroft, Mads Rosendahl
    Minimal Function Graphs are not Instrumented. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:60-67 [Conf]
  9. Geoff W. Hamilton
    Sharing Analysis of Lazy First-Order Functional Programs. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:68-78 [Conf]
  10. Bernard P. Serpette
    Approximations d'évaluateurs fonctionnels. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:79-90 [Conf]
  11. Young Gil Park, Benjamin Goldberg
    Order-of-Demand Analysis for Lazy Languages. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:91-101 [Conf]
  12. E. Saint-James
    Partial Evaluation in an Industrial Context: Compiling for Endomorphic Machines. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:102-108 [Conf]
  13. Christian Queinnec, P. Geffroy
    Partial Evaluation applied to Symbolic Pattern Matching with Intelligent Backtrack. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:109-117 [Conf]
  14. Maria J. García de la Banda, Manuel V. Hermenegildo
    A Practical Application of Sharing and Freeness Inference. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:118-125 [Conf]
  15. A. E. Ayers
    Efficient Closure Analysis with Reachability. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:126-134 [Conf]
  16. Tadashi Araragi
    Program Transformation in a Nonmonotonic Reasoning System. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:135-143 [Conf]
  17. Thomas P. Jensen
    Axiomatising Uniform Properties of Recursive Data Structures. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:144-151 [Conf]
  18. Matthijs F. Kuiper
    Speeding Up Parallelism Detection for Attribute Grammars. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:152-162 [Conf]
  19. Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier
    Weighted Systems Revisited. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:163-173 [Conf]
  20. Giuseppe Amato, Fosca Giannotti, Gianni Mainetto
    Analysis of Concurrent Transactions in a Functional Database Programming Language. [Citation Graph (1, 0)][DBLP]
    WSA, 1992, pp:174-184 [Conf]
  21. Jean-Louis Giavitto, Jean-Paul Sansonnet, Olivier Michel
    Inférer rapidement la géométrie des collections. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:185-193 [Conf]
  22. Fosca Giannotti, Diego Latella
    Using Abstract Interpretation for Gate splitting in LOTOS Specifications. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:194-204 [Conf]
  23. Yamine Aït Ameur, Patrice Cros, J.-J. Falcon, A. Gomez
    An Application of Abstract Interpretation to Floating Point Arithmetic. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:205-212 [Conf]
  24. Paul Y. Gloess, Y.-N. Huang, Chu Min Li, M.-A. Hernandez
    On Boolean Feature Types. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:213-220 [Conf]
  25. Clement A. Baker-Finch
    Relevant Logic and Strictness Analysis. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:221-228 [Conf]
  26. Baudouin Le Charlier, Pascal Van Hentenryck
    On the Design of Generic Abstract Interpretation Frameworks. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:229-246 [Conf]
  27. Kirsten Lackner Solberg, Hanne Riis Nielson, Flemming Nielson
    Inference Systems for Binding Time Analysis. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:247-254 [Conf]
  28. Peter T. Breuer, Jonathan P. Bowen
    Decompilation is the Efficient Enumeration of Types. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:255-273 [Conf]
  29. Bruno Monsuez
    Fractional Types. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:274-284 [Conf]
  30. John P. Gallagher
    Static Analysis for Logic Program Specification. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:285-294 [Conf]
  31. Anne Parrain, Philippe Devienne, Patrick Lebègue
    Towards Optimization of Full Prolog Programs guided by Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:295-303 [Conf]
  32. Michael Hanus
    An Abstract Interpretation Algorithm for Residuating Logic Programs. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:304-312 [Conf]
  33. Yan Mei Tang, Pierre Jouvelot
    Control-Flow Effects for Escape Analysis. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:313-321 [Conf]
  34. Marc Gengler, M. Rytz
    A Polyvariant Binding Time Analysis Handling Partially Known Values. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:322-330 [Conf]
  35. Denis Bechet
    Partial Evaluation of Interaction Nets. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:331-338 [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