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