2007 |
63 | EE | Annalisa Bossi,
Ombretta Gaggi:
Enriching SMIL with assertions for temporal validation.
ACM Multimedia 2007: 107-116 |
62 | EE | Annalisa Bossi,
Carla Piazza,
Sabina Rossi:
Action Refinement in Process Algebra and Security Issues.
LOPSTR 2007: 201-217 |
61 | EE | Annalisa Bossi,
Carla Piazza,
Sabina Rossi:
Compositional information flow security for concurrent programs.
Journal of Computer Security 15(3): 373-416 (2007) |
2006 |
60 | | Annalisa Bossi,
Michael J. Maher:
Proceedings of the 8th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 10-12, 2006, Venice, Italy
ACM 2006 |
2005 |
59 | EE | Annalisa Bossi,
Damiano Macedonio,
Carla Piazza,
Sabina Rossi:
Information flow in secure contexts.
Journal of Computer Security 13(3): 391-422 (2005) |
2004 |
58 | EE | Annalisa Bossi,
Carla Piazza,
Sabina Rossi:
Modelling Downgrading in Information Flow Security.
CSFW 2004: 187- |
57 | EE | Annalisa Bossi,
Carla Piazza,
Sabina Rossi:
Unwinding Conditions for Security in Imperative Languages.
LOPSTR 2004: 85-100 |
56 | EE | Annalisa Bossi,
Nicoletta Cocco,
Sandro Etalle,
Sabina Rossi:
Declarative Semantics of Input Consuming Logic Programs.
Program Development in Computational Logic 2004: 90-114 |
55 | EE | Annalisa Bossi,
Sandro Etalle,
Sabina Rossi,
Jan-Georg Smaus:
Termination of simply moded logic programs with dynamic scheduling.
ACM Trans. Comput. Log. 5(3): 470-507 (2004) |
54 | EE | Annalisa Bossi,
Riccardo Focardi,
Carla Piazza,
Sabina Rossi:
Verifying persistent security properties.
Computer Languages, Systems & Structures 30(3-4): 231-258 (2004) |
53 | EE | Annalisa Bossi,
Riccardo Focardi,
Damiano Macedonio,
Carla Piazza,
Sabina Rossi:
Unwinding in Information Flow Security.
Electr. Notes Theor. Comput. Sci. 99: 127-154 (2004) |
2003 |
52 | EE | Annalisa Bossi,
Damiano Macedonio,
Carla Piazza,
Sabina Rossi:
Secure Contexts for Confidential Data.
CSFW 2003: 14-28 |
51 | EE | Annalisa Bossi,
Damiano Macedonio,
Carla Piazza,
Sabina Rossi:
Information Flow Security and Recursive Systems.
ICTCS 2003: 369-382 |
50 | EE | Annalisa Bossi,
Riccardo Focardi,
Carla Piazza,
Sabina Rossi:
Refinement Operators and Information Flow Security.
SEFM 2003: 44-53 |
49 | EE | Annalisa Bossi,
Riccardo Focardi,
Carla Piazza,
Sabina Rossi:
Bisimulation and Unwinding for Verifying Possibilistic Security Properties.
VMCAI 2003: 223-237 |
2002 |
48 | EE | Annalisa Bossi,
Riccardo Focardi,
Carla Piazza,
Sabina Rossi:
Transforming Processes to Check and Ensure Information Flow Security.
AMAST 2002: 271-286 |
47 | EE | Annalisa Bossi,
Nicoletta Cocco,
Sandro Etalle:
Transformation Systems and Nondeclarative Properties.
Computational Logic: Logic Programming and Beyond 2002: 162-186 |
46 | EE | Annalisa Bossi,
Riccardo Focardi,
Carla Piazza,
Sabina Rossi:
A Proof System for Information Flow Security.
LOPSTR 2002: 199-218 |
45 | | Annalisa Bossi,
Sandro Etalle,
Sabina Rossi:
Properties of input-consuming derivations.
TPLP 2(2): 125-154 (2002) |
44 | | Annalisa Bossi,
Nicoletta Cocco,
Sandro Etalle,
Sabina Rossi:
On modular termination proofs of general logic programs.
TPLP 2(3): 263-291 (2002) |
2001 |
43 | EE | Annalisa Bossi,
Sandro Etalle,
Sabina Rossi,
Jan-Georg Smaus:
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling.
ESOP 2001: 402-416 |
42 | | Annalisa Bossi,
Nicoletta Cocco,
Sabina Rossi:
Termination of Well-Typed Logic Programs.
PPDP 2001: 73-81 |
41 | EE | Annalisa Bossi,
Sandro Etalle,
Sabina Rossi,
Jan-Georg Smaus:
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling
CoRR cs.LO/0101022: (2001) |
40 | EE | Annalisa Bossi,
Sandro Etalle,
Sabina Rossi:
Properties of Input-Consuming Derivations
CoRR cs.PL/0101023: (2001) |
2000 |
39 | | Annalisa Bossi:
Logic Programming Synthesis and Transformation, 9th International Workshop, LOPSTR'99, Venezia, Italy, September 22-24, 1999, Selected Papers
Springer 2000 |
38 | EE | Annalisa Bossi,
Sandro Etalle,
Sabina Rossi:
Semantics of Input-Consuming Logic Programs.
Computational Logic 2000: 194-208 |
37 | EE | Annalisa Bossi,
Nicoletta Cocco,
Sandro Etalle,
Sabina Rossi:
On Modular Termination Proofs of General Logic Programs
CoRR cs.LO/0005018: (2000) |
36 | | Annalisa Bossi,
Sandro Etalle,
Sabina Rossi:
Semantics of well-moded input-consuming logic programs.
Comput. Lang. 26(1): 1-25 (2000) |
35 | | Sofie Verbaeten,
Annalisa Bossi:
Composing Complete and Partial Knowledge.
Journal of Functional and Logic Programming 2000(6): (2000) |
1999 |
34 | | Annalisa Bossi,
Nicoletta Cocco,
Sandro Etalle:
Transformation of Left Terminating Programs.
LOPSTR 1999: 156-175 |
33 | EE | Annalisa Bossi,
Sandro Etalle,
Sabina Rossi:
Properties of Input-Consuming Derivations.
Electr. Notes Theor. Comput. Sci. 30(1): (1999) |
32 | | Sandro Etalle,
Annalisa Bossi,
Nicoletta Cocco:
Termination of Well-Moded Programs.
J. Log. Program. 38(2): 243-257 (1999) |
31 | | Annalisa Bossi,
Yves Deville:
Guest Editors' Introduction Special Issue: Synthesis, Transformation and Analysis of Logic Rrograms 2.
J. Log. Program. 41(2-3): 139-140 (1999) |
1998 |
30 | EE | Annalisa Bossi,
Sabina Rossi:
Specialising Logic Programs with Respect to Call?Post Specifications.
LOPSTR 1998: 159-178 |
29 | EE | Annalisa Bossi,
Nicoletta Cocco:
Success in Logic Programs.
LOPSTR 1998: 219-239 |
1997 |
28 | | Annalisa Bossi,
Dennis Dams,
Gilberto Filé,
Elena Marchiori:
Verification, Model Checking and Abstract Interpretation (Workshop Overview).
ILPS 1997: 421-422 |
27 | EE | Annalisa Bossi,
Nicoletta Cocco:
Programs Without Failures.
LOPSTR 1997: 28-48 |
1996 |
26 | | Annalisa Bossi,
Nicoletta Cocco:
Replacement Can Preserve Termination.
LOPSTR 1996: 104-129 |
25 | | Annalisa Bossi,
Nicoletta Cocco,
Sandro Etalle:
Simultaneous Replacement in Normal Programs.
J. Log. Comput. 6(1): 79-120 (1996) |
24 | | Annalisa Bossi,
Michele Bugliesi,
Maurizio Gabbrielli,
Giorgio Levi,
Maria Chiara Meo:
Differential Logic Programs: Programming Methodologies and Semantics.
Sci. Comput. Program. 27(3): 217-262 (1996) |
1995 |
23 | | Annalisa Bossi,
Nicoletta Cocco,
Sandro Etalle:
Transformation of Left Terminating Programs: the Reordering Problem.
LOPSTR 1995: 33-45 |
1994 |
22 | | Annalisa Bossi,
Nicoletta Cocco:
Preserving Universal Termination through Unfold/Fold.
ALP 1994: 269-286 |
21 | | Annalisa Bossi,
Massimo Fabris,
Maria Chiara Meo:
A Bottom-up Semantics for Constructive Negation.
ICLP 1994: 520-534 |
20 | | Annalisa Bossi,
Sandro Etalle:
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics.
META 1994: 311-331 |
19 | EE | Annalisa Bossi,
Sandro Etalle:
Transforming Acyclic Programs.
ACM Trans. Program. Lang. Syst. 16(4): 1081-1096 (1994) |
18 | | Annalisa Bossi,
Maurizio Gabbrielli,
Giorgio Levi,
Maurizio Martelli:
The s-Semantics Approach: Theory and Applications.
J. Log. Program. 19/20: 149-197 (1994) |
17 | | Annalisa Bossi,
Maurizio Gabbrielli,
Giorgio Levi,
Maria Chiara Meo:
A Compositional Semantics for Logic Programs.
Theor. Comput. Sci. 122(1&2): 3-47 (1994) |
16 | | 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 |
15 | | Annalisa Bossi,
Michele Bugliesi,
Massimo Fabris:
A New Fixpoint Semantics for Prolog.
GULP 1993: 617-632 |
14 | | Annalisa Bossi,
Michele Bugliesi,
Massimo Fabris:
A New Fixpoint Semantics for Prolog.
ICLP 1993: 374-389 |
13 | | Annalisa Bossi,
Michele Bugliesi:
Differential Logic Programming.
POPL 1993: 359-370 |
12 | | Annalisa Bossi,
Nicoletta Cocco:
Basic Transformation Operations which Preserve Computed Answer Substitutions of Logic Programs.
J. Log. Program. 16(1): 47-87 (1993) |
1992 |
11 | | Annalisa Bossi,
Nicoletta Cocco,
Massimo Fabris:
Typed Norms.
ESOP 1992: 73-92 |
10 | | Annalisa Bossi,
Maurizio Gabbrielli,
Giorgio Levi,
Maria Chiara Meo:
Contributions to the Semantics of Open Logic Programs.
FGCS 1992: 570-580 |
9 | | Annalisa Bossi,
Nicoletta Cocco,
Sandro Etalle:
Transforming Normal Programs by Replacement.
META 1992: 265-279 |
8 | | Annalisa Bossi,
Nicoletta Cocco,
Sandro Etalle:
On Safe Folding.
PLILP 1992: 172-186 |
7 | | Annalisa Bossi,
Silvio Valentini:
An Intuitionistic Theory of Types with Assumptions of High-Arity Variables.
Ann. Pure Appl. Logic 57(2): 93-149 (1992) |
1991 |
6 | | Annalisa Bossi,
Maurizio Gabbrielli,
Giorgio Levi,
Maria Chiara Meo:
An OR-Compositional Semantics for Logic Programs.
ICLP Workshop on Construction of Logic Programs 1991: 215-240 |
5 | | Annalisa Bossi,
Nicoletta Cocco,
Massimo Fabris:
Proving Termination of Logic Programs by Exploiting Term Properties.
TAPSOFT, Vol.2 1991: 153-180 |
1990 |
4 | EE | Annalisa Bossi,
Nicoletta Cocco,
S. Dulli:
A Method for Specializing Logic Programs.
ACM Trans. Program. Lang. Syst. 12(2): 253-302 (1990) |
1989 |
3 | | Annalisa Bossi,
Nicoletta Cocco:
Verifying Correctness of Logic Programs.
TAPSOFT, Vol.2 1989: 96-110 |
1984 |
2 | | Annalisa Bossi,
Carlo Ghezzi:
Using FP As a Query Language for Relational Data-Bases.
Comput. Lang. 9(1): 25-37 (1984) |
1983 |
1 | | Annalisa Bossi,
Nicoletta Cocco,
Livio Colussi:
A Divide-and-Conquer Approach to General Context-Free Parsing.
Inf. Process. Lett. 16(4): 203-208 (1983) |