Travelled to:1 × Australia
1 × Denmark
1 × France
1 × Hungary
1 × Sweden
1 × The Netherlands
2 × Belgium
2 × Spain
2 × USA
2 × United Kingdom
6 × Italy
Collaborated with:N.Cocco S.Rossi S.Etalle C.Piazza M.Fabris R.Focardi M.C.Meo M.Bugliesi J.Smaus M.Gabbrielli G.Levi
Talks about:program (13) logic (9) termin (7) semant (6) secur (5) transform (3) preserv (3) fold (3) properti (2) verifi (2)
Person: Annalisa Bossi
DBLP: Bossi:Annalisa
Facilitated 2 volumes:
Ed
EdContributed to:
200720042004
2003
20032002
20012001
2000199919981997199619951994
199419941993
199319921992
19891991Wrote 24 papers:
- LOPSTR-2007-BossiPR #algebra #process #refinement #security
- Action Refinement in Process Algebra and Security Issues (AB, CP, SR), pp. 201–217.
- LOPSTR-2004-BossiPR #imperative #security
- Unwinding Conditions for Security in Imperative Languages (AB, CP, SR), pp. 85–100.
- PDCL-2004-BossiCER #declarative #logic programming #semantics #source code
- Declarative Semantics of Input Consuming Logic Programs (AB, NC, SE, SR), pp. 90–114.
- SEFM-2003-BossiFPR #data flow #refinement #security
- Refinement Operators and Information Flow Security (AB, RF, CP, SR), pp. 44–53.
- VMCAI-2003-BossiFPR #bisimulation #security #verification
- Bisimulation and Unwinding for Verifying Possibilistic Security Properties (AB, RF, CP, SR), pp. 223–237.
- LOPSTR-2002-BossiFPR #data flow #proving #security
- A Proof System for Information Flow Security (AB, RF, CP, SR), pp. 199–218.
- ESOP-2001-BossiERS #logic programming #scheduling #semantics #source code #termination
- Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling (AB, SE, SR, JGS), pp. 402–416.
- PPDP-2001-BossiCR #logic programming #source code #termination
- Termination of Well-Typed Logic Programs (AB, NC, SR), pp. 73–81.
- CL-2000-BossiER #logic programming #semantics #source code
- Semantics of Input-Consuming Logic Programs (AB, SE, SR), pp. 194–208.
- 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-1998-BossiR #logic programming #source code #specification
- Specialising Logic Programs with Respect to Call?Post Specifications (AB, SR), pp. 159–178.
- 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.
- ICLP-1994-BossiFM #bottom-up #semantics
- A Bottom-up Semantics for Constructive Negation (AB, MF, MCM), pp. 520–534.
- LOPSTR-1994-BossiE #semantics #source code
- More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting’s Semantics (AB, SE), pp. 311–331.
- ICLP-1993-BossiBF #fixpoint #prolog #semantics
- A New Fixpoint Semantics for Prolog (AB, MB, MF), pp. 374–389.
- POPL-1993-BossiB #difference #logic programming
- Differential Logic Programming (AB, MB, MG, GL, MCM), pp. 359–370.
- 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.