Annalisa Bossi

Publication Activity (10 Years)

Years Active: 1980-2011
Publications (10 Years): 0

Publications

Annalisa Bossi, Nicoletta Cocco
A valuable experience in logic programming. Intelligenza Artificiale 5 (1) (2011)
Ombretta Gaggi, Annalisa Bossi
Analysis and verification of SMIL documents. Multim. Syst. 17 (6) (2011)
Annalisa Bossi
S-semantics for logic programming: A retrospective look. Theor. Comput. Sci. 410 (46) (2009)
Annalisa Bossi, Nicoletta Cocco
A Valuable Experience in Computational Logic. Il Milione (2008)
Annalisa Bossi, Carla Piazza, Sabina Rossi
Action Refinement in Process Algebra and Security Issues. LOPSTR (2007)
Annalisa Bossi, Carla Piazza, Sabina Rossi
Compositional information flow security for concurrent programs. J. Comput. Secur. 15 (3) (2007)
Annalisa Bossi, Ombretta Gaggi
Enriching SMIL with assertions for temporal validation. ACM Multimedia (2007)
Annalisa Bossi, Damiano Macedonio, Carla Piazza, Sabina Rossi
Information flow in secure contexts. J. Comput. Secur. 13 (3) (2005)
Annalisa Bossi, Riccardo Focardi, Carla Piazza, Sabina Rossi
Verifying persistent security properties. Comput. Lang. Syst. Struct. 30 (3-4) (2004)
Annalisa Bossi, Riccardo Focardi, Damiano Macedonio, Carla Piazza, Sabina Rossi
Unwinding in Information Flow Security. Electron. Notes Theor. Comput. Sci. 99 (2004)
Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus
Termination of simply moded logic programs with dynamic scheduling. ACM Trans. Comput. Log. 5 (3) (2004)
Annalisa Bossi, Carla Piazza, Sabina Rossi
Unwinding Conditions for Security in Imperative Languages. LOPSTR (2004)
Annalisa Bossi, Carla Piazza, Sabina Rossi
Modelling Downgrading in Information Flow Security. CSFW (2004)
Annalisa Bossi, Riccardo Focardi, Carla Piazza, Sabina Rossi
Bisimulation and Unwinding for Verifying Possibilistic Security Properties. VMCAI (2003)
Annalisa Bossi, Damiano Macedonio, Carla Piazza, Sabina Rossi
Secure Contexts for Confidential Data. CSFW (2003)
Annalisa Bossi, Riccardo Focardi, Carla Piazza, Sabina Rossi
Refinement Operators and Information Flow Security. SEFM (2003)
Annalisa Bossi, Damiano Macedonio, Carla Piazza, Sabina Rossi
Information Flow Security and Recursive Systems. ICTCS (2003)
Annalisa Bossi, Riccardo Focardi, Carla Piazza, Sabina Rossi
Transforming Processes to Check and Ensure Information Flow Security. AMAST (2002)
Annalisa Bossi, Riccardo Focardi, Carla Piazza, Sabina Rossi
A Proof System for Information Flow Security. LOPSTR (2002)
Annalisa Bossi, Sandro Etalle, Sabina Rossi
Properties of input-consuming derivations. Theory Pract. Log. Program. 2 (2) (2002)
Annalisa Bossi, Nicoletta Cocco, Sandro Etalle
Transformation Systems and Nondeclarative Properties. Computational Logic: Logic Programming and Beyond (2002)
Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sabina Rossi
On modular termination proofs of general logic programs. Theory Pract. Log. Program. 2 (3) (2002)
Annalisa Bossi, Sandro Etalle, Sabina Rossi
Properties of Input-Consuming Derivations CoRR (2001)
Annalisa Bossi, Nicoletta Cocco, Sabina Rossi
Termination of Well-Typed Logic Programs. PPDP (2001)
Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling CoRR (2001)
Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling. ESOP (2001)
Sofie Verbaeten, Annalisa Bossi
Composing Complete and Partial Knowledge. J. Funct. Log. Program. 2000 (6) (2000)
Annalisa Bossi, Sandro Etalle, Sabina Rossi
Semantics of Input-Consuming Logic Programs. Computational Logic (2000)
Annalisa Bossi, Sandro Etalle, Sabina Rossi
Semantics of well-moded input-consuming logic programs. Comput. Lang. 26 (1) (2000)
Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sabina Rossi
On Modular Termination Proofs of General Logic Programs CoRR (2000)
Annalisa Bossi, Nicoletta Cocco, Sandro Etalle
Transformation of Left Terminating Programs. LOPSTR (1999)
Annalisa Bossi, Yves Deville
Guest Editors' Introduction Special Issue: Synthesis, Transformation and Analysis of Logic Rrograms 2. J. Log. Program. 41 (2-3) (1999)
Annalisa Bossi, Sandro Etalle, Sabina Rossi
Properties of Input-Consuming Derivations. Electron. Notes Theor. Comput. Sci. 30 (1) (1999)
Sandro Etalle, Annalisa Bossi, Nicoletta Cocco
Termination of Well-Moded Programs. J. Log. Program. 38 (2) (1999)
Annalisa Bossi, Sabina Rossi
Specialising Logic Programs with Respect to Call?Post Specifications. LOPSTR (1998)
Annalisa Bossi, Nicoletta Cocco
Success in Logic Programs. LOPSTR (1998)
Annalisa Bossi, Nicoletta Cocco
Programs Without Failures. LOPSTR (1997)
Annalisa Bossi, Dennis Dams, Gilberto Filé, Elena Marchiori
Verification, Model Checking and Abstract Interpretation (Workshop Overview). ILPS (1997)
Annalisa Bossi, Nicoletta Cocco
Replacement Can Preserve Termination. LOPSTR (1996)
Annalisa Bossi, Nicoletta Cocco, Sandro Etalle
Simultaneous Replacement in Normal Programs. J. Log. Comput. 6 (1) (1996)
Annalisa Bossi, Michele Bugliesi, Maurizio Gabbrielli, Giorgio Levi, Maria Chiara Meo
Differential Logic Programs: Programming Methodologies and Semantics. Sci. Comput. Program. 27 (3) (1996)
Annalisa Bossi, Nicoletta Cocco, Sandro Etalle
Transformation of Left Terminating Programs: the Reordering Problem. LOPSTR (1995)
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) (1994)
Annalisa Bossi, Nicoletta Cocco
Preserving Universal Termination through Unfold/Fold. ALP (1994)
Annalisa Bossi, Sandro Etalle
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics. META (1994)
Annalisa Bossi, Maurizio Gabbrielli, Giorgio Levi, Maria Chiara Meo
A Compositional Semantics for Logic Programs. Theor. Comput. Sci. 122 (1&2) (1994)
Annalisa Bossi, Maurizio Gabbrielli, Giorgio Levi, Maurizio Martelli
The s-Semantics Approach: Theory and Applications. J. Log. Program. (1994)
Annalisa Bossi, Massimo Fabris, Maria Chiara Meo
A Bottom-up Semantics for Constructive Negation. ICLP (1994)
Annalisa Bossi, Sandro Etalle
Transforming Acyclic Programs. ACM Trans. Program. Lang. Syst. 16 (4) (1994)
Annalisa Bossi, Michele Bugliesi, Massimo Fabris
A New Fixpoint Semantics for Prolog. ICLP (1993)
Annalisa Bossi, Nicoletta Cocco
Basic Transformation Operations which Preserve Computed Answer Substitutions of Logic Programs. J. Log. Program. 16 (1) (1993)
Annalisa Bossi, Michele Bugliesi, Maurizio Gabbrielli, Giorgio Levi, Maria Chiara Meo
Differential Logic Programming. POPL (1993)
Annalisa Bossi, Michele Bugliesi, Massimo Fabris
A New Fixpoint Semantics for Prolog. GULP (1993)
Annalisa Bossi, Nicoletta Cocco, Massimo Fabris
Typed Norms. ESOP (1992)
Annalisa Bossi, Maurizio Gabbrielli, Giorgio Levi, Maria Chiara Meo
Contributions to the Semantics of Open Logic Programs. FGCS (1992)
Annalisa Bossi, Silvio Valentini
An Intuitionistic Theory of Types with Assumptions of High-Arity Variables. Ann. Pure Appl. Log. 57 (2) (1992)
Annalisa Bossi, Nicoletta Cocco, Sandro Etalle
On Safe Folding. PLILP (1992)
Annalisa Bossi, Nicoletta Cocco, Sandro Etalle
Transforming Normal Programs by Replacement. META (1992)
Annalisa Bossi, Nicoletta Cocco, Massimo Fabris
Proving Termination of Logic Programs by Exploiting Term Properties. TAPSOFT, Vol.2 (1991)
Annalisa Bossi, Maurizio Gabbrielli, Giorgio Levi, Maria Chiara Meo
An OR-Compositional Semantics for Logic Programs. ICLP Workshop on Construction of Logic Programs (1991)
Annalisa Bossi, Nicoletta Cocco, Susi Dulli
A Method for Specializing Logic Programs. ACM Trans. Program. Lang. Syst. 12 (2) (1990)
Annalisa Bossi, Nicoletta Cocco
Verifying Correctness of Logic Programs. TAPSOFT, Vol.2 (1989)
Annalisa Bossi, Carlo Ghezzi
Using FP As a Query Language for Relational Data-Bases. Comput. Lang. 9 (1) (1984)
Annalisa Bossi, Nicoletta Cocco, Livio Colussi
A Divide-and-Conquer Approach to General Context-Free Parsing. Inf. Process. Lett. 16 (4) (1983)
Annalisa Bossi, Livio Colussi, Claudio Cobelli, Giorgio Romanin-Jacur
Identifiability of compartmental models: algorithms to solve an actual problem by means of symbolic calculus. SIGSAM Bull. 14 (4) (1980)