Travelled to:1 × France
1 × Spain
1 × Sweden
1 × The Netherlands
1 × United Kingdom
2 × Belgium
2 × Italy
Collaborated with:A.Bossi S.Etalle M.Fabris S.Rossi
Talks about:program (8) termin (6) logic (5) transform (2) preserv (2) type (2) left (2) fold (2) properti (1) without (1)
Person: Nicoletta Cocco
DBLP: Cocco:Nicoletta
Contributed to:
2004
2001199919981997199619951994
19921992
19891991Wrote 12 papers:
- PDCL-2004-BossiCER #declarative #logic programming #semantics #source code
- Declarative Semantics of Input Consuming Logic Programs (AB, NC, SE, SR), pp. 90–114.
- PPDP-2001-BossiCR #logic programming #source code #termination
- Termination of Well-Typed Logic Programs (AB, NC, SR), pp. 73–81.
- LOPSTR-1999-BossiCE #source code
- Transformation of Left Terminating Programs (AB, NC, SE), pp. 156–175.
- LOPSTR-1998-BossiC #logic programming #source code
- Success in Logic Programs (AB, NC), pp. 219–239.
- LOPSTR-1997-BossiC #source code
- Programs Without Failures (AB, NC), pp. 28–48.
- LOPSTR-1996-BossiC #termination
- Replacement Can Preserve Termination (AB, NC), pp. 104–129.
- LOPSTR-1995-BossiCE #order #problem #source code
- Transformation of Left Terminating Programs: the Reordering Problem (AB, NC, SE), pp. 33–45.
- ALP-1994-BossiC #termination
- Preserving Universal Termination through Unfold/Fold (AB, NC), pp. 269–286.
- ESOP-1992-BossiCF
- Typed Norms (AB, NC, MF), pp. 73–92.
- PLILP-1992-BossiCE #on the
- On Safe Folding (AB, NC, SE), pp. 172–186.
- CCIPL-1989-BossiC #correctness #logic programming #source code #verification
- Verifying Correctness of Logic Programs (AB, NC), pp. 96–110.
- CCPSD-1991-BossiCF #logic programming #proving #source code #termination
- Proving Termination of Logic Programs by Exploiting Term Properties (AB, NC, MF), pp. 153–180.