Identifiability of compartmental models: algorithms to solve an actual problem by means of symbolic calculus. - Annalisa Bossi; Livio Colussi; Claudio Cobelli; Giorgio Romanin-Jacur (SIGSAM Bull., 1980)

A Divide-and-Conquer Approach to General Context-Free Parsing. - Annalisa Bossi; Nicoletta Cocco; Livio Colussi (Inf. Process. Lett., 1983)

Using FP As a Query Language for Relational Data-Bases. - Annalisa Bossi; Carlo Ghezzi (Comput. Lang., 1984)

Verifying Correctness of Logic Programs. - Annalisa Bossi; Nicoletta Cocco (TAPSOFT, Vol.2, 1989)

A Method for Specializing Logic Programs. - Annalisa Bossi; Nicoletta Cocco; Susi Dulli (ACM Trans. Program. Lang. Syst., 1990)

An OR-Compositional Semantics for Logic Programs. - Annalisa Bossi; Maurizio Gabbrielli; Giorgio Levi; Maria Chiara Meo (ICLP Workshop on Construction of Logic Programs, 1991)

Proving Termination of Logic Programs by Exploiting Term Properties. - Annalisa Bossi; Nicoletta Cocco; Massimo Fabris (TAPSOFT, Vol.2, 1991)

Typed Norms. - Annalisa Bossi; Nicoletta Cocco; Massimo Fabris (ESOP, 1992)

Contributions to the Semantics of Open Logic Programs. - Annalisa Bossi; Maurizio Gabbrielli; Giorgio Levi; Maria Chiara Meo (FGCS, 1992)

Transforming Normal Programs by Replacement. - Annalisa Bossi; Nicoletta Cocco; Sandro Etalle (META, 1992)

On Safe Folding. - Annalisa Bossi; Nicoletta Cocco; Sandro Etalle (PLILP, 1992)

An Intuitionistic Theory of Types with Assumptions of High-Arity Variables. - Annalisa Bossi; Silvio Valentini (Ann. Pure Appl. Log., 1992)

A New Fixpoint Semantics for Prolog. - Annalisa Bossi; Michele Bugliesi; Massimo Fabris (ICLP, 1993)

Differential Logic Programming. - Annalisa Bossi; Michele Bugliesi; Maurizio Gabbrielli; Giorgio Levi; Maria Chiara Meo (POPL, 1993)

Basic Transformation Operations which Preserve Computed Answer Substitutions of Logic Programs. - Annalisa Bossi; Nicoletta Cocco (J. Log. Program., 1993)

Preserving Universal Termination through Unfold/Fold. - Annalisa Bossi; Nicoletta Cocco (ALP, 1994)

A Bottom-up Semantics for Constructive Negation. - Annalisa Bossi; Massimo Fabris; Maria Chiara Meo (ICLP, 1994)

More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics. - Annalisa Bossi; Sandro Etalle (META, 1994)

The s-Semantics Approach: Theory and Applications. - Annalisa Bossi; Maurizio Gabbrielli; Giorgio Levi; Maurizio Martelli (J. Log. Program., 1994)

Norms on Terms and their use in Proving Universal Termination of a Logic Program. - Annalisa Bossi; Nicoletta Cocco; Massimo Fabris (Theor. Comput. Sci., 1994)

A Compositional Semantics for Logic Programs. - Annalisa Bossi; Maurizio Gabbrielli; Giorgio Levi; Maria Chiara Meo (Theor. Comput. Sci., 1994)

Transforming Acyclic Programs. - Annalisa Bossi; Sandro Etalle (ACM Trans. Program. Lang. Syst., 1994)

Transformation of Left Terminating Programs: the Reordering Problem. - Annalisa Bossi; Nicoletta Cocco; Sandro Etalle (LOPSTR, 1995)

Replacement Can Preserve Termination. - Annalisa Bossi; Nicoletta Cocco (LOPSTR, 1996)

Simultaneous Replacement in Normal Programs. - Annalisa Bossi; Nicoletta Cocco; Sandro Etalle (J. Log. Comput., 1996)

Differential Logic Programs: Programming Methodologies and Semantics. - Annalisa Bossi; Michele Bugliesi; Maurizio Gabbrielli; Giorgio Levi; Maria Chiara Meo (Sci. Comput. Program., 1996)

Programs Without Failures. - Annalisa Bossi; Nicoletta Cocco (LOPSTR, 1997)

Verification, Model Checking and Abstract Interpretation (Workshop Overview). - Annalisa Bossi; Dennis Dams; Gilberto Filé; Elena Marchiori (ILPS, 1997)

Success in Logic Programs. - Annalisa Bossi; Nicoletta Cocco (LOPSTR, 1998)

Specialising Logic Programs with Respect to Call?Post Specifications. - Annalisa Bossi; Sabina Rossi (LOPSTR, 1998)

Transformation of Left Terminating Programs. - Annalisa Bossi; Nicoletta Cocco; Sandro Etalle (LOPSTR, 1999)

Guest Editors' Introduction Special Issue: Synthesis, Transformation and Analysis of Logic Rrograms 2. - Annalisa Bossi; Yves Deville (J. Log. Program., 1999)

Termination of Well-Moded Programs. - Sandro Etalle; Annalisa Bossi; Nicoletta Cocco (J. Log. Program., 1999)

Semantics of Input-Consuming Logic Programs. - Annalisa Bossi; Sandro Etalle; Sabina Rossi (Computational Logic, 2000)

Semantics of well-moded input-consuming logic programs. - Annalisa Bossi; Sandro Etalle; Sabina Rossi (Comput. Lang., 2000)

Composing Complete and Partial Knowledge. - Sofie Verbaeten; Annalisa Bossi (J. Funct. Log. Program., 2000)

Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling. - Annalisa Bossi; Sandro Etalle; Sabina Rossi; Jan-Georg Smaus (ESOP, 2001)

Termination of Well-Typed Logic Programs. - Annalisa Bossi; Nicoletta Cocco; Sabina Rossi (PPDP, 2001)

Transforming Processes to Check and Ensure Information Flow Security. - Annalisa Bossi; Riccardo Focardi; Carla Piazza; Sabina Rossi (AMAST, 2002)

Transformation Systems and Nondeclarative Properties. - Annalisa Bossi; Nicoletta Cocco; Sandro Etalle (Computational Logic: Logic Programming and Beyond, 2002)

A Proof System for Information Flow Security. - Annalisa Bossi; Riccardo Focardi; Carla Piazza; Sabina Rossi (LOPSTR, 2002)

On modular termination proofs of general logic programs. - Annalisa Bossi; Nicoletta Cocco; Sandro Etalle; Sabina Rossi (Theory Pract. Log. Program., 2002)

Properties of input-consuming derivations. - Annalisa Bossi; Sandro Etalle; Sabina Rossi (Theory Pract. Log. Program., 2002)

Secure Contexts for Confidential Data. - Annalisa Bossi; Damiano Macedonio; Carla Piazza; Sabina Rossi (CSFW, 2003)

Information Flow Security and Recursive Systems. - Annalisa Bossi; Damiano Macedonio; Carla Piazza; Sabina Rossi (ICTCS, 2003)

Refinement Operators and Information Flow Security. - Annalisa Bossi; Riccardo Focardi; Carla Piazza; Sabina Rossi (SEFM, 2003)

Bisimulation and Unwinding for Verifying Possibilistic Security Properties. - Annalisa Bossi; Riccardo Focardi; Carla Piazza; Sabina Rossi (VMCAI, 2003)

Unwinding in Information Flow Security. - Annalisa Bossi; Riccardo Focardi; Damiano Macedonio; Carla Piazza; Sabina Rossi (MEFISTO, 2003)

Modelling Downgrading in Information Flow Security. - Annalisa Bossi; Carla Piazza; Sabina Rossi (CSFW, 2004)

Declarative Semantics of Input Consuming Logic Programs. - Annalisa Bossi; Nicoletta Cocco; Sandro Etalle; Sabina Rossi (Program Development in Computational Logic, 2004)

Unwinding Conditions for Security in Imperative Languages. - Annalisa Bossi; Carla Piazza; Sabina Rossi (LOPSTR, 2004)

Verifying persistent security properties. - Annalisa Bossi; Riccardo Focardi; Carla Piazza; Sabina Rossi (Comput. Lang. Syst. Struct., 2004)

Termination of simply moded logic programs with dynamic scheduling. - Annalisa Bossi; Sandro Etalle; Sabina Rossi; Jan-Georg Smaus (ACM Trans. Comput. Log., 2004)

Information flow in secure contexts. - Annalisa Bossi; Damiano Macedonio; Carla Piazza; Sabina Rossi (J. Comput. Secur., 2005)

Action Refinement in Process Algebra and Security Issues. - Annalisa Bossi; Carla Piazza; Sabina Rossi (LOPSTR, 2007)

Enriching SMIL with assertions for temporal validation. - Annalisa Bossi; Ombretta Gaggi (ACM Multimedia, 2007)

Compositional information flow security for concurrent programs. - Annalisa Bossi; Carla Piazza; Sabina Rossi (J. Comput. Secur., 2007)

A Valuable Experience in Computational Logic. - Annalisa Bossi; Nicoletta Cocco (Il Milione, 2008)

S-semantics for logic programming: A retrospective look. - Annalisa Bossi (Theor. Comput. Sci., 2009)

Theoretical Foundations and Semantics of Logic Programming. - Annalisa Bossi; Maria Chiara Meo (25 Years GULP, 2010)

A valuable experience in logic programming. - Annalisa Bossi; Nicoletta Cocco (Intelligenza Artificiale, 2011)

Analysis and verification of SMIL documents. - Ombretta Gaggi; Annalisa Bossi (Multim. Syst., 2011)