The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nicoletta Cocco: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Annalisa Bossi, Nicoletta Cocco, S. Dulli
    A Method for Specializing Logic Programs. [Citation Graph (1, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1990, v:12, n:2, pp:253-302 [Journal]
  2. Annalisa Bossi, Nicoletta Cocco
    Preserving Universal Termination through Unfold/Fold. [Citation Graph (0, 0)][DBLP]
    ALP, 1994, pp:269-286 [Conf]
  3. Annalisa Bossi, Nicoletta Cocco, Sandro Etalle
    Transformation Systems and Nondeclarative Properties. [Citation Graph (0, 0)][DBLP]
    Computational Logic: Logic Programming and Beyond, 2002, pp:162-186 [Conf]
  4. Annalisa Bossi, Nicoletta Cocco, Massimo Fabris
    Typed Norms. [Citation Graph (0, 0)][DBLP]
    ESOP, 1992, pp:73-92 [Conf]
  5. Annalisa Bossi, Nicoletta Cocco
    Replacement Can Preserve Termination. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1996, pp:104-129 [Conf]
  6. Annalisa Bossi, Nicoletta Cocco
    Programs Without Failures. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1997, pp:28-48 [Conf]
  7. Annalisa Bossi, Nicoletta Cocco
    Success in Logic Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1998, pp:219-239 [Conf]
  8. Annalisa Bossi, Nicoletta Cocco, Sandro Etalle
    Transformation of Left Terminating Programs: the Reordering Problem. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1995, pp:33-45 [Conf]
  9. Annalisa Bossi, Nicoletta Cocco, Sandro Etalle
    Transformation of Left Terminating Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1999, pp:156-175 [Conf]
  10. Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sabina Rossi
    Declarative Semantics of Input Consuming Logic Programs. [Citation Graph (0, 0)][DBLP]
    Program Development in Computational Logic, 2004, pp:90-114 [Conf]
  11. Annalisa Bossi, Nicoletta Cocco, Sandro Etalle
    Transforming Normal Programs by Replacement. [Citation Graph (0, 0)][DBLP]
    META, 1992, pp:265-279 [Conf]
  12. Annalisa Bossi, Nicoletta Cocco, Sandro Etalle
    On Safe Folding. [Citation Graph (0, 0)][DBLP]
    PLILP, 1992, pp:172-186 [Conf]
  13. Annalisa Bossi, Nicoletta Cocco, Sabina Rossi
    Termination of Well-Typed Logic Programs. [Citation Graph (0, 0)][DBLP]
    PPDP, 2001, pp:73-81 [Conf]
  14. Annalisa Bossi, Nicoletta Cocco
    Verifying Correctness of Logic Programs. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.2, 1989, pp:96-110 [Conf]
  15. Annalisa Bossi, Nicoletta Cocco, Massimo Fabris
    Proving Termination of Logic Programs by Exploiting Term Properties. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.2, 1991, pp:153-180 [Conf]
  16. Nicoletta Cocco, S. Dulli
    A Mechanism for Exception Handling and Its Verification Rules. [Citation Graph (0, 0)][DBLP]
    Comput. Lang., 1982, v:7, n:2, pp:89-102 [Journal]
  17. Nicoletta Cocco, Dino Mandrioli, Vitaliano Milanese
    The Ada Task System and Real-Time Applications: An Implementation Schema. [Citation Graph (0, 0)][DBLP]
    Comput. Lang., 1985, v:10, n:3/4, pp:189-209 [Journal]
  18. Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sabina Rossi
    On Modular Termination Proofs of General Logic Programs [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  19. Annalisa Bossi, Nicoletta Cocco, Livio Colussi
    A Divide-and-Conquer Approach to General Context-Free Parsing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:4, pp:203-208 [Journal]
  20. Annalisa Bossi, Nicoletta Cocco
    Basic Transformation Operations which Preserve Computed Answer Substitutions of Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1993, v:16, n:1, pp:47-87 [Journal]
  21. Sandro Etalle, Annalisa Bossi, Nicoletta Cocco
    Termination of Well-Moded Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1999, v:38, n:2, pp:243-257 [Journal]
  22. Annalisa Bossi, Nicoletta Cocco, Sandro Etalle
    Simultaneous Replacement in Normal Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1996, v:6, n:1, pp:79-120 [Journal]
  23. Annalisa Bossi, Nicoletta Cocco, Massimo Fabris
    Norms on Terms and their use in Proving Universal Termination of a Logic Program. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:124, n:2, pp:297-328 [Journal]
  24. Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sabina Rossi
    On modular termination proofs of general logic programs. [Citation Graph (0, 0)][DBLP]
    TPLP, 2002, v:2, n:3, pp:263-291 [Journal]

Search in 0.003secs, Finished in 0.005secs
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