Nicoletta Cocco

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

Coauthor Index

1	Paolo Baldan	[25]
2	Annalisa Bossi	[2] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [26]
3	Livio Colussi	[2]
4	S. Dulli	[1] [5]
5	Sandro Etalle	[7] [8] [13] [14] [18] [19] [20] [22] [23] [24]
6	Massimo Fabris	[6] [9] [11]
7	Dino Mandrioli	[3]
8	Andrea Marin	[25]
9	Vitaliano Milanese	[3]
10	Sabina Rossi	[20] [21] [22] [24]
11	Marta Simeoni	[25]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page