Bossi A., Cocco N., Etalle S. e Rossi S., On Modular Termination Proofs of General Logic Programs. Theory and Practice of Logic Programming, 2:3, 263-291 (2002).
Etalle S., Bossi A. e Cocco N., Termination of Well-Moded Programs. Journal of Logic Programming, 38:2, 243-257 (1999).
Bossi A., Cocco N., Etalle S., Simultaneous Replacement in Normal Programs, Journal of Logic and Computation, 6:1, 79-120 (1996).
Bossi A., Cocco N., Fabris M., Norms on Terms and Their Use in Proving Universal Termination of a Logic Program, Theoretical Computer Science, 124, 297-328 (1994).
Bossi A., Cocco N., Basic Transformation Operations for Logic Programs which Preserve Computed Answer Substitutions, Journal of Logic Programming, 16, 47-87 (1993).
Bossi A., Cocco N., Dulli S., A method for specializing logic programs, TOPLAS ACM, 12: 2, 253-302 (1990).
Cocco N., Mandrioli D., Milanese V., The Ada Task System and Real-Time Applications: an Implementation Schema, Computer Languages, 10: 3/4, 189-209 (1985).
Bossi A., Cocco N., Colussi L., A divide-and-conquer approach to general context-free parsing, Information Processing Letters, 16: 4, 203-208 (1983).
Bossi A., Cocco N., Dulli S., Modular decomposition of Ada into a hierarchy of sublanguages, ACM Ada Letters, II-6.53 II-6.58 (1983).
Cocco N., Dulli S., A mechanism for exception handling and its verification rules, Computer Languages, 7, 89-102 (1982).
Bossi A., Cocco N., Etalle S. e Rossi S., Declarative Semantics of Input-Consuming Logic Programs, in M. Bruynooghe and K. Lau editors, Program Development in Computational Logic - A Decade of Research Advances in Logic-Based Program Development, Springer-Verlag, LNCS 3049, 90-114 (2004).
Bossi A., Cocco N. e Etalle S., Transformation Systems and Nondeclarative Properties, in A. Kakas and F. Sadri editors, Computational Logic: Logic Programming and Beyond (Essays in Honour of Robert A. Kowalski), Springer-Verlag, LNAI 2407, 162-186 (2002).
Termination of Well-Typed Logic Programs, Proceedings of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'01), Firenze, Italy, ACM Press, 73-81 (2001).
Bossi A., Cocco N., Etalle S. Transformation of Left Terminating Programs, Proceedings LOPSTR'99, Venezia, Italy, LNCS 1817, 156-175 (2000).
Bossi A., Cocco N., Successes in Logic Programs, Proceedings LOPSTR'98, Manchester, UK, LNCS 1559, 219-239 (1999).
Bossi A., Cocco N., Programs without Failures, Proceedings LOPSTR'97, Leuven, Belgium, LNCS 1463, 28-48 (1998).
Bossi A., Cocco N., Replacement Can Preserve Termination, Proceedings LOPSTR'96, Stockholm, Sweden, LNCS 1207, 104-129 (1997).
Bossi A., Cocco N., S. Etalle, Transformation of Left Terminating Programs: The Reordering Problem, Proceedings LOPSTR'95, Utrecht, The Netherlands, LNCS 1048, 33-45, (1996).
Bossi A., Cocco N., Preserving Universal Termination through Unfold/Fold, Proceedings ALP'94, Madrid, Spain, LNCS 850, 269-286 (1994).
Bossi A., Cocco N., S. Etalle, Transforming Normal Programs by Replacement, Proceedings META'92, Uppsala, Sweden, LNCS 649, 265-279 (1993).
Bossi A., Cocco N., S. Etalle, On Safe Folding, Proceedings PLILP'92, Leuven, Belgium, LNCS 631, 172-186 (1992).
Bossi A., Cocco N., Fabris M., Typed Norms, Proceedings ESOP'92, Rennes, France, LNCS 582, 73-92 (1992).
Bossi A., Cocco N., Fabris M., Proving Termination of Logic Programs by Exploiting Term Properties, Proceedings CCPSD-TAPSOFT'91, Brighton, Great Britain, LNCS 494, 153-180 (1991).
Bossi A., Cocco N., Verifying correctness of logic programs, Proceedings CCIPL-TAPSOFT'89, Barcellona, Spain, LNCS 352, 96-110 (1989).