The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Fausto Spoto: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. S. Bozzoli, Fausto Spoto, Agostino Dovier
    Approximate Protein Folding in Oz through Frequency Analysis. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 2003, pp:123-134 [Conf]
  2. Roberta Gori, E. Lastres, R. Moreno, Fausto Spoto
    Aproximating the Well-Founded Semantics for Normal Logic Programs using Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1998, pp:433-442 [Conf]
  3. Patricia M. Hill, Fausto Spoto
    Freeness Analysis through Linear Refinement. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:321-337 [Conf]
  4. Giorgio Levi, Fausto Spoto
    Accurate Analysis of Prolog with cut. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1996, pp:481-492 [Conf]
  5. Fausto Spoto, Giorgio Levi
    A Denotational Semantics for Prolog. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1997, pp:201-212 [Conf]
  6. Fausto Spoto, Giorgio Levi
    An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1998, pp:269-282 [Conf]
  7. Patricia M. Hill, Fausto Spoto
    Analysis of Downward Closed Properties of Logic Programs. [Citation Graph (0, 0)][DBLP]
    AMAST, 2000, pp:181-196 [Conf]
  8. Patricia M. Hill, Fausto Spoto
    A Foundation of Escape Analysis. [Citation Graph (0, 0)][DBLP]
    AMAST, 2002, pp:380-395 [Conf]
  9. Fausto Spoto, Giorgio Levi
    Abstract Interpretation of Prolog Programs. [Citation Graph (0, 0)][DBLP]
    AMAST, 1998, pp:455-470 [Conf]
  10. Gianluca Amato, Fausto Spoto
    Abstract Compilation for Sharing Analysis. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2001, pp:311-325 [Conf]
  11. Thomas P. Jensen, Fausto Spoto
    Class Analysis of Object-Oriented Programs through Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:261-275 [Conf]
  12. Fausto Spoto
    Information Flow Is Linear Refinement of Constancy. [Citation Graph (0, 0)][DBLP]
    ICTAC, 2005, pp:351-365 [Conf]
  13. Patricia M. Hill, Fausto Spoto
    Logic Programs as Compact Denotations. [Citation Graph (0, 0)][DBLP]
    PADL, 2003, pp:339-356 [Conf]
  14. Giorgio Levi, Fausto Spoto
    Non Pair-Sharing and Freeness Analysis Through Linear Refinement. [Citation Graph (0, 0)][DBLP]
    PEPM, 2000, pp:52-61 [Conf]
  15. Giorgio Levi, Fausto Spoto
    An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs. [Citation Graph (0, 0)][DBLP]
    PLILP/ALP, 1998, pp:152-169 [Conf]
  16. Patricia M. Hill, Fausto Spoto
    Freeness Analysis Through Linear Refinement. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:85-100 [Conf]
  17. Stefano Secci, Fausto Spoto
    Pair-Sharing Analysis of Object-Oriented Programs. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:320-335 [Conf]
  18. Fausto Spoto
    Watchpoint Semantics: A Tool for Compositional and Focussed Static Analyses. [Citation Graph (0, 0)][DBLP]
    SAS, 2001, pp:127-145 [Conf]
  19. Patricia M. Hill, Fausto Spoto
    A Refinement of the Escape Property. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2002, pp:154-166 [Conf]
  20. Stefano Rossignoli, Fausto Spoto
    Detecting Non-cyclicity by Abstract Compilation into Boolean Functions. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2006, pp:95-110 [Conf]
  21. Samir Genaim, Fausto Spoto
    Information Flow Analysis for Java Bytecode. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:346-362 [Conf]
  22. Patricia M. Hill, Fausto Spoto
    Logic programs as compact denotations. [Citation Graph (0, 0)][DBLP]
    Computer Languages, Systems & Structures, 2003, v:29, n:3, pp:45-73 [Journal]
  23. Fausto Spoto
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:141, n:1, pp:1- [Journal]
  24. Giorgio Levi, Fausto Spoto
    Pair-independence and freeness analysis through linear refinement. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:182, n:1, pp:14-52 [Journal]
  25. Fausto Spoto
    Operational and Goal-Independent Denotational Semantics for Prolog with Cut. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 2000, v:42, n:1, pp:1-46 [Journal]
  26. Patricia M. Hill, Fausto Spoto
    Deriving escape analysis by abstract interpretation. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2006, v:19, n:4, pp:415-463 [Journal]
  27. Patricia M. Hill, Fausto Spoto
    Generalizing Def and Pos to Type Analysis. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2002, v:12, n:3, pp:497-542 [Journal]
  28. Fausto Spoto, Thomas P. Jensen
    Class analyses as abstract interpretations of trace semantics. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2003, v:25, n:5, pp:578-630 [Journal]
  29. Étienne Payet, Fausto Spoto
    Magic-Sets Transformation for the Analysis of Java Bytecode. [Citation Graph (0, 0)][DBLP]
    SAS, 2007, pp:452-467 [Conf]
  30. Patricia M. Hill, Fausto Spoto
    Deriving Escape Analysis by Abstract Interpretation: Proofs of results [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  31. Marieke Huisman, Fausto Spoto
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:190, n:1, pp:1- [Journal]

  32. Special track on Software Verification: editorial message. [Citation Graph (, )][DBLP]


  33. Nullness Analysis in Boolean Form. [Citation Graph (, )][DBLP]


  34. Experiments with Non-Termination Analysis for Java Bytecode. [Citation Graph (, )][DBLP]


  35. Using CLP Simplifications to Improve Java Bytecode Termination Analysis. [Citation Graph (, )][DBLP]


Search in 0.015secs, Finished in 0.016secs
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