A. Bossi, C. Piazza, S. Rossi. Compositional information flow security for concurrent programs .
Journal of Computer Security, 15(3), pp. 373-413. IOS Press, 2007.

Annalisa Bossi, Michael J. Maher (eds.). Proceedings of the 8th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 10-12, 2006, Venice, Italy ACM 2006.

A. Bossi, D. Macedonio, C. Piazza, S. Rossi. Information Flow in Secure Contexts .
Journal of Computer Security, 13(3), pp. 391-422. IOS Press, 2005.

A. Bossi, C. Piazza, S. Rossi. Unwinding Conditions for Security in Imperative Languages. In S. Etalle (ed.) Logic Based Program Synthesis and Transformation. 14th International Symposium, LOPSTR 2004, Verona, Italy, August 2004. Revised Selected Papers. (pp. 85-100). ISBN: 0302-9743. LNCS 3573: Springer (GERMANY).

A. Bossi, R. Focardi, D. Macedonio, C. Piazza, S. Rossi. Unwinding in Information Flow Security.
Electronic Notes in Theoretical Computer Science. Volume 99 , 6 August 2004, Pages 127-154. Elsevier B.V.

A. Bossi, C. Piazza, S. Rossi. Modelling Downgrading in Information Flow Security .
Proc. of the 17th IEEE Computer Security Foundations Workshop (CSFW'04), pages 187-201,
IEEE Computer Society Press,  2004.

A. Bossi, R. Focardi, C. Piazza, and S. Rossi.Verifying Persistent Security Properties .
Computer Languages, Systems and Structures, volume 30, n. 3-4, pag. 231-258, 2004. Elsevier Science.

A. Bossi, S. Etalle, S. Rossi and J.-G. Smaus. Termination of Simply Moded Logic Programs with Dynamic Scheduling .
ACM Transactions on Computational Logic (TOCL), 5(3), pag. 470-507, 2004. ACM Press.

Bossi, N. Cocco, S. Etalle, S. Rossi. Declarative Semantics of Input Consuming Logic Programs.
In Program Development in Computational Logic, Lecture Notes in Computer Science 3049, M. Bruynooghe, K-K. Lau (Eds.),
pag. 90--114, 2004.

 A. Bossi, D. Macedonio, C. Piazza and S. Rossi. Information Flow Security and Recursive Systems .
In Proc. of the Italian Conference on Theoretical Computer Science (ICTCS'03),
 LNCS 2841, pages 369--382. Springer-Verlag, 2003.

 A. Bossi, R. Focardi, C. Piazza and S. Rossi. Refinement Operators and Information Flow Security.
 Proc. of the 1st IEEE Int. Conference on Software Engineering and Formal Methods (SEFM'03),
 pages  44-53, IEEE Computer Society Press, 2003.

A. Bossi, D. Macedonio, C. Piazza and S. Rossi.  Secure Contexts for Confidential Data,
Proc. of the 16th IEEE Computer Security Foundations Workshop (CSFW'03), pages 14-25,
IEEE Computer Society Press,  2003.

A. Bossi, R. Focardi, C. Piazza and S. Rossi. Bisimulation and Unwinding for Verifying Possibilistic Security Properties,
Proc. of  Int. Conference on Verification, Model Checking, and Abstract Interpretation  (VMCAI'03),
LNCS 2575,   pages 223-237, Springer, 2003.

A. Bossi, R.Focardi, C. Piazza and S. Rossi. A Proof System for Information Flow Security.
In M. Leuschel (ed.) Logic Based Program Synthesis and Transformation.
LNCS 2664, pages 199-218, Springer, 2003.

A. Bossi, R.Focardi, C. Piazza and S. Rossi. Transforming processes to check and ensure Information Flow Security.
Proc. Int. Conference on Algebraic Methodology and Software Technology
( AMAST'02). LNCS 2422, pages 271-286,
Springer, 2002.

A. Bossi, N. Cocco, S. Etalle. Transformation Systems and Nondeclarative Properties. In A.C. Kakas, F. Sadri (Eds.) Computational Logic: Logic Programming and Beyond. Essays in Honour of Robert A. Kowalski, Part I. LNAI 2407, pages 162-186, Springer, 2002.

A. Bossi, N. Cocco, S. Etalle, and S. Rossi. On Modular Termination Proofs of General Logic Programs. Theory and Practice of Logic Programming (TPLP), 2(3): 263-291, 2002.

A. Bossi, S. Etalle, S. Rossi. Properties of Input-Consuming Derivations. Theory and Practice of Logic Programming (TPLP), 2(2): 125-154, 2002.

A. Bossi, S. Etalle, S. Rossi, J.-G. Smaus. Semantics and Termination of Simply-moded Logic Programs with Dynamic Scheduling. D. Sands (ed.), Proc. European Symposium on Programming, ESOP2001, Lecture Notes in Computer Science 2028, pages 402-416, Springer, Berlin, 2001.

A. Bossi, N. Cocco, S. Rossi. Termination of well-typed logic programs. Proceedings of the 3rd International ACM SIGPLAN Conference on Principle and Practice of Declarative Programming (PPDP'01), ACM Press, pages 73-81, 2001.

Bossi, S. Etalle, and S. Rossi. Semantics of well-moded input-consuming logic programs.
Computer Languages, 26(1): 1-25 (2000).

Bossi, S. Etalle, and S. Rossi. Semantics of input-consuming programs. In J. Lloyd et. al., editor, First International Conference on Computational Logic (CL2000), Lecture Notes in Artificial Intelligence 1861, pages 194-208. Springer-Verlag, 2000. 
Bossi, N. Cocco, and S. Etalle. Transformation of left terminating programs. In A. Bossi, editor, Ninth International Workshop on Logic-Based Program Synthesis and Transformation - Selected papers, Lecture Notes in Computer Science 1817, pages 156-175. Springer-Verlag, 2000. 
Bossi (editor). Ninth International Workshop on Logic-Based Program Synthesis and Transformation - Selected Papers. Lecture Notes in Computer Science 1817, Springer-Verlag, 2000. 
S. Verbaeten and A. Bossi. Composing complete and partial knowledge. Journal of Functional and Logic Programming, 6:1-25, 2000. 
Bossi and Y. Deville. Guest Editors' Introduction. Special Issue on Synthesis, Transformation and Analysis of Logic Programs, Journal of Logic Programming, volume 39 (1-3) pages 1-2 and volume 41 (2-3) pages 139-140, Elsevier Science Inc., 1999. 
Bossi, S. Etalle, and S. Rossi.  Properties of input-consuming derivations. Electronic Notes of Theoretical Computer Science, 30, 1999.
A. Bossi and N. Cocco. Successes in Logic Programs, in P. Flener ed., Logic-Based Program Synthesis and Transformation - LOPSTR'98 selected papers, Lecture Notes in Computer Science 1559, pp.219-239, Springer-Verlag, Berlin, 1999.
A. Bossi and S. Rossi. Specialising Logic Programs wrt Pre/Post Specifications, in P. Flener ed., Logic-Based Program Synthesis and Transformation - LOPSTR'98 selected papers, Lecture Notes in Computer Science 1559, pp.159-179, Springer-Verlag, Berlin, 1999.
S. Etalle, A. Bossi and N. Cocco. Termination of Well-Moded Programs, Journal of Logic Programming, Vol.38(2), p. 243-257, 1999.
A. Bossi and N. Cocco. Programs Without Failures. In N. Fuchs ed, Proceedings of LOPSTR'97, Lecture Notes in Computer Science 1463, pp. 104-129, Springer-Verlag, Berlin, 1998.
A. Bossi and S. Rossi. Call-Correct Specialisation of Logic Programs, in Degano P. and Vaccaro U. and Pirillo G eds., Sixth Italian Conference on Theoretical Computer Science, World Scientific, Singapore, p. 335-346, 1998.
A. Bossi, N. Cocco. Replacement Can Preserve Termination, in J. Gallagher ed., Logic Program Synthesis and Transformation , Lecture Notes in Computer Science 1207, pp. 104-129, Springer-Verlag 1997.
A. Bossi, N. Cocco, and S. Etalle. Simultaneous Replacement in Normal Programs. Journal of Logic and Computation, 6(1): 79-120, 1996.
A. Bossi, M. Bugliesi, M. Gabbrielli, G. Levi, e M.C. Meo. Differential logic programs: Programming methodologies and semantics, Science of Computer Programming, 27(3): 217-262, 1996.
A. Bossi, N. Cocco, and S. Etalle. Transforming Left Terminating Programs: the reordering problem. In M. Proietti ed., Logic Program Synthesis and Transformation, Lecture Notes in Computer Science 1048, pp. 33-45, Springer-Verlag 1996.
A. Bossi and. S. Etalle. More on Unfold/ Fold Transformations of Logic Programs: preservation of Fitting's semantics. In L. Fribourg and F. Turini, ed., Logic Program Synthesis and Transformation - Meta-Programming in Logic, Lecture Notes in Computer Science 883, Springer-Verlag, Berlin, pp. 311-331, 1994.
A. Bossi and N. Cocco. Preserving Universal Termination through Unfold/ Fold. In G. Levi and M. Rodriguez-Artalejo editors, Proceedings of ALP'94, Lecture Notes in Computer Science 850, Springer-Verlag, Berlin, pp. 269-286, 1994.
A. Bossi, M. Fabris, and M.C. Meo. A Bottom-up Semantics for Constructive Negation. In P. Van Hentenryck, editor, Proceedings of the Int. Conf. on Logic Programming, ICLP'94, The MIT Press, pp. 520-534, 1994.
A. Bossi and S. Etalle. Transforming acyclic programs. ACM Transactions on Programming Languages and Systems, 16(4):1081-1096, 1994.
A. Bossi, M. Martelli, M. Gabbrielli, and G. Levi. The s-sematics approach: theory and applications. Journal of Logic Programming, 19-20:149-197, 1994.
S. Etalle, A. Bossi and N. Cocco. Termination of Well-Moded Programs, Journal of Logic Programming, Vol.38(2), p. 243-257, 1999.
A. Bossi, M. Gabbrielli, G. Levi, and M. C. Meo. A Compositional Semantics for Logic Programs. Theoretical Computer Science, 122(1-2):3--47, 1994.
A. Bossi, N. Cocco, and M. Fabris. Norms on Terms and their use in {Proving Universal Termination of a Logic Program. Theoretical Computer Science, 124:297-328, 1994.
A. Bossi, M. Bugliesi, and M. Fabris. A New Fixpoint Semantics for Prolog. In D. Warren, editor, Proceedings of the Tenth Int. Conf. on Logic Programming, ICLP'93, pages 374--389. The MIT Press, 1993.
A. Bossi, M. Bugliesi, M. Gabbrielli, G. Levi, and M.C. Meo. Differential Logic Programming. In Proceedings ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '93, pages 359--370. ACM, 1993.
A. Bossi and N. Cocco. Basic Transformation Operations which preserve Computed Answer Substitutions of Logic Programs. Journal of Logic Programming, 16:47--87, 1993.