A Mechanism for Exception Handling and Its Verification Rules. - Nicoletta Cocco; Susi Dulli (Comput. Lang., 1982)

A Divide-and-Conquer Approach to General Context-Free Parsing. - Annalisa Bossi; Nicoletta Cocco; Livio Colussi (Inf. Process. Lett., 1983)

The Ada Task System and Real-Time Applications: An Implementation Schema. - Nicoletta Cocco; Dino Mandrioli; Vitaliano Milanese (Comput. Lang., 1985)

Verifying Correctness of Logic Programs. - Annalisa Bossi; Nicoletta Cocco (TAPSOFT, Vol.2, 1989)

A Method for Specializing Logic Programs. - Annalisa Bossi; Nicoletta Cocco; Susi Dulli (ACM Trans. Program. Lang. Syst., 1990)

Proving Termination of Logic Programs by Exploiting Term Properties. - Annalisa Bossi; Nicoletta Cocco; Massimo Fabris (TAPSOFT, Vol.2, 1991)

Typed Norms. - Annalisa Bossi; Nicoletta Cocco; Massimo Fabris (ESOP, 1992)

Transforming Normal Programs by Replacement. - Annalisa Bossi; Nicoletta Cocco; Sandro Etalle (META, 1992)

On Safe Folding. - Annalisa Bossi; Nicoletta Cocco; Sandro Etalle (PLILP, 1992)

Basic Transformation Operations which Preserve Computed Answer Substitutions of Logic Programs. - Annalisa Bossi; Nicoletta Cocco (J. Log. Program., 1993)

Preserving Universal Termination through Unfold/Fold. - Annalisa Bossi; Nicoletta Cocco (ALP, 1994)

Norms on Terms and their use in Proving Universal Termination of a Logic Program. - Annalisa Bossi; Nicoletta Cocco; Massimo Fabris (Theor. Comput. Sci., 1994)

Transformation of Left Terminating Programs: the Reordering Problem. - Annalisa Bossi; Nicoletta Cocco; Sandro Etalle (LOPSTR, 1995)

Replacement Can Preserve Termination. - Annalisa Bossi; Nicoletta Cocco (LOPSTR, 1996)

Simultaneous Replacement in Normal Programs. - Annalisa Bossi; Nicoletta Cocco; Sandro Etalle (J. Log. Comput., 1996)

Programs Without Failures. - Annalisa Bossi; Nicoletta Cocco (LOPSTR, 1997)

Success in Logic Programs. - Annalisa Bossi; Nicoletta Cocco (LOPSTR, 1998)

Transformation of Left Terminating Programs. - Annalisa Bossi; Nicoletta Cocco; Sandro Etalle (LOPSTR, 1999)

Termination of Well-Moded Programs. - Sandro Etalle; Annalisa Bossi; Nicoletta Cocco (J. Log. Program., 1999)

Termination of Well-Typed Logic Programs. - Annalisa Bossi; Nicoletta Cocco; Sabina Rossi (PPDP, 2001)

Transformation Systems and Nondeclarative Properties. - Annalisa Bossi; Nicoletta Cocco; Sandro Etalle (Computational Logic: Logic Programming and Beyond, 2002)

On modular termination proofs of general logic programs. - Annalisa Bossi; Nicoletta Cocco; Sandro Etalle; Sabina Rossi (Theory Pract. Log. Program., 2002)

Declarative Semantics of Input Consuming Logic Programs. - Annalisa Bossi; Nicoletta Cocco; Sandro Etalle; Sabina Rossi (Program Development in Computational Logic, 2004)

A Valuable Experience in Computational Logic. - Annalisa Bossi; Nicoletta Cocco (Il Milione, 2008)

Petri nets for modelling metabolic pathways: a survey. - Paolo Baldan; Nicoletta Cocco; Andrea Marin; Marta Simeoni (Nat. Comput., 2010)

A valuable experience in logic programming. - Annalisa Bossi; Nicoletta Cocco (Intelligenza Artificiale, 2011)

Comparing metabolic pathways through potential fluxes: a selective opening approach. - Paolo Baldan; Martina Bocci; Nicoletta Cocco; Marta Simeoni (BioPPN@Petri Nets, 2013)

Representing and Comparing Metabolic Pathways as Petri Nets with MPath2PN and CoMeta. - Paolo Baldan; Nicoletta Cocco; Marta Simeoni (CS2Bio, 2013)

Comparing Metabolic Pathways through Reactions and Potential Fluxes. - Paolo Baldan; Nicoletta Cocco; Federica Giummolè; Marta Simeoni (Trans. Petri Nets Other Model. Concurr., 2013)

Petri nets for modelling and analysing trophic networks. - Paolo Baldan; Martina Bocci; Daniele Brigolin; Nicoletta Cocco; Marta Simeoni (BioPPN@Petri Nets, 2015)

Petri Nets for Modelling and Analysing Trophic Networks. - Paolo Baldan; Martina Bocci; Daniele Brigolin; Nicoletta Cocco; Monika Heiner; Marta Simeoni (Fundam. Informaticae, 2018)