default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnalisa Bossi
Person information
- affiliation: Ca' Foscari University of Venice, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j25]Annalisa Bossi, Nicoletta Cocco:
A valuable experience in logic programming. Intelligenza Artificiale 5(1): 95-99 (2011)- [j24]Ombretta Gaggi, Annalisa Bossi:
Analysis and verification of SMIL documents. Multim. Syst. 17(6): 487-506 (2011) - 2010
- [p2]Annalisa Bossi, Maria Chiara Meo
:
Theoretical Foundations and Semantics of Logic Programming. 25 Years GULP 2010: 15-36
2000 – 2009
- 2009
- [j23]Annalisa Bossi:
S-semantics for logic programming: A retrospective look. Theor. Comput. Sci. 410(46): 4692-4703 (2009) - 2008
- [c37]Annalisa Bossi, Nicoletta Cocco:
A Valuable Experience in Computational Logic. Il Milione 2008 - 2007
- [j22]Annalisa Bossi, Carla Piazza, Sabina Rossi:
Compositional information flow security for concurrent programs. J. Comput. Secur. 15(3): 373-416 (2007) - [c36]Annalisa Bossi, Carla Piazza, Sabina Rossi:
Action Refinement in Process Algebra and Security Issues. LOPSTR 2007: 201-217 - [c35]Annalisa Bossi, Ombretta Gaggi:
Enriching SMIL with assertions for temporal validation. ACM Multimedia 2007: 107-116 - 2006
- [e2]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, ISBN 1-59593-388-3 [contents] - 2005
- [j21]Annalisa Bossi, Damiano Macedonio, Carla Piazza, Sabina Rossi:
Information flow in secure contexts. J. Comput. Secur. 13(3): 391-422 (2005) - 2004
- [j20]Annalisa Bossi, Riccardo Focardi, Carla Piazza, Sabina Rossi:
Verifying persistent security properties. Comput. Lang. Syst. Struct. 30(3-4): 231-258 (2004) - [j19]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) - [c34]Annalisa Bossi, Carla Piazza, Sabina Rossi:
Modelling Downgrading in Information Flow Security. CSFW 2004: 187- - [c33]Annalisa Bossi, Carla Piazza, Sabina Rossi:
Unwinding Conditions for Security in Imperative Languages. LOPSTR 2004: 85-100 - [p1]Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sabina Rossi:
Declarative Semantics of Input Consuming Logic Programs. Program Development in Computational Logic 2004: 90-114 - 2003
- [c32]Annalisa Bossi, Damiano Macedonio, Carla Piazza, Sabina Rossi:
Secure Contexts for Confidential Data. CSFW 2003: 14-28 - [c31]Annalisa Bossi, Damiano Macedonio, Carla Piazza, Sabina Rossi:
Information Flow Security and Recursive Systems. ICTCS 2003: 369-382 - [c30]Annalisa Bossi, Riccardo Focardi, Carla Piazza, Sabina Rossi:
Refinement Operators and Information Flow Security. SEFM 2003: 44-53 - [c29]Annalisa Bossi, Riccardo Focardi, Carla Piazza, Sabina Rossi:
Bisimulation and Unwinding for Verifying Possibilistic Security Properties. VMCAI 2003: 223-237 - [c28]Annalisa Bossi, Riccardo Focardi, Damiano Macedonio, Carla Piazza, Sabina Rossi:
Unwinding in Information Flow Security. MEFISTO 2003: 127-154 - 2002
- [j18]Annalisa Bossi, Sandro Etalle, Sabina Rossi:
Properties of input-consuming derivations. Theory Pract. Log. Program. 2(2): 125-154 (2002) - [j17]Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sabina Rossi:
On modular termination proofs of general logic programs. Theory Pract. Log. Program. 2(3): 263-291 (2002) - [c27]Annalisa Bossi, Riccardo Focardi, Carla Piazza, Sabina Rossi:
Transforming Processes to Check and Ensure Information Flow Security. AMAST 2002: 271-286 - [c26]Annalisa Bossi, Nicoletta Cocco, Sandro Etalle:
Transformation Systems and Nondeclarative Properties. Computational Logic: Logic Programming and Beyond 2002: 162-186 - [c25]Annalisa Bossi, Riccardo Focardi, Carla Piazza, Sabina Rossi:
A Proof System for Information Flow Security. LOPSTR 2002: 199-218 - 2001
- [c24]Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus:
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling. ESOP 2001: 402-416 - [c23]Annalisa Bossi, Nicoletta Cocco, Sabina Rossi:
Termination of Well-Typed Logic Programs. PPDP 2001: 73-81 - [i3]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) - [i2]Annalisa Bossi, Sandro Etalle, Sabina Rossi:
Properties of Input-Consuming Derivations. CoRR cs.PL/0101023 (2001) - 2000
- [j16]Annalisa Bossi, Sandro Etalle, Sabina Rossi:
Semantics of well-moded input-consuming logic programs. Comput. Lang. 26(1): 1-25 (2000) - [j15]Sofie Verbaeten, Annalisa Bossi:
Composing Complete and Partial Knowledge. J. Funct. Log. Program. 2000(6) (2000) - [c22]Annalisa Bossi, Sandro Etalle, Sabina Rossi:
Semantics of Input-Consuming Logic Programs. Computational Logic 2000: 194-208 - [e1]Annalisa Bossi:
Logic Programming Synthesis and Transformation, 9th International Workshop, LOPSTR'99, Venezia, Italy, September 22-24, 1999, Selected Papers. Lecture Notes in Computer Science 1817, Springer 2000, ISBN 3-540-67628-7 [contents] - [i1]Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sabina Rossi:
On Modular Termination Proofs of General Logic Programs. CoRR cs.LO/0005018 (2000)
1990 – 1999
- 1999
- [j14]Sandro Etalle, Annalisa Bossi, Nicoletta Cocco:
Termination of Well-Moded Programs. J. Log. Program. 38(2): 243-257 (1999) - [j13]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) - [c21]Annalisa Bossi, Nicoletta Cocco, Sandro Etalle:
Transformation of Left Terminating Programs. LOPSTR 1999: 156-175 - [c20]Annalisa Bossi, Sandro Etalle, Sabina Rossi:
Properties of Input-Consuming Derivations. Verification of Logic Programs@ICLP 1999: 102-124 - 1998
- [c19]Annalisa Bossi, Sabina Rossi:
Specialising Logic Programs with Respect to Call?Post Specifications. LOPSTR 1998: 159-178 - [c18]Annalisa Bossi, Nicoletta Cocco:
Success in Logic Programs. LOPSTR 1998: 219-239 - 1997
- [c17]Annalisa Bossi, Nicoletta Cocco:
Programs Without Failures. LOPSTR 1997: 28-48 - [c16]Annalisa Bossi, Dennis Dams, Gilberto Filé, Elena Marchiori:
Verification, Model Checking and Abstract Interpretation (Workshop Overview). ILPS 1997: 421-422 - 1996
- [j12]Annalisa Bossi, Nicoletta Cocco, Sandro Etalle:
Simultaneous Replacement in Normal Programs. J. Log. Comput. 6(1): 79-120 (1996) - [j11]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) - [c15]Annalisa Bossi, Nicoletta Cocco:
Replacement Can Preserve Termination. LOPSTR 1996: 104-129 - 1995
- [c14]Annalisa Bossi, Nicoletta Cocco, Sandro Etalle:
Transformation of Left Terminating Programs: the Reordering Problem. LOPSTR 1995: 33-45 - 1994
- [j10]Annalisa Bossi, Maurizio Gabbrielli, Giorgio Levi, Maurizio Martelli:
The s-Semantics Approach: Theory and Applications. J. Log. Program. 19/20: 149-197 (1994) - [j9]Annalisa Bossi, Maurizio Gabbrielli, Giorgio Levi, Maria Chiara Meo:
A Compositional Semantics for Logic Programs. Theor. Comput. Sci. 122(1&2): 3-47 (1994) - [j8]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) - [j7]Annalisa Bossi, Sandro Etalle:
Transforming Acyclic Programs. ACM Trans. Program. Lang. Syst. 16(4): 1081-1096 (1994) - [c13]Annalisa Bossi, Nicoletta Cocco:
Preserving Universal Termination through Unfold/Fold. ALP 1994: 269-286 - [c12]Annalisa Bossi, Massimo Fabris, Maria Chiara Meo:
A Bottom-up Semantics for Constructive Negation. ICLP 1994: 520-534 - [c11]Annalisa Bossi, Sandro Etalle:
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics. META 1994: 311-331 - 1993
- [j6]Annalisa Bossi, Nicoletta Cocco:
Basic Transformation Operations which Preserve Computed Answer Substitutions of Logic Programs. J. Log. Program. 16(1): 47-87 (1993) - [c10]Annalisa Bossi, Michele Bugliesi, Massimo Fabris:
A New Fixpoint Semantics for Prolog. GULP 1993: 617-632 - [c9]Annalisa Bossi, Michele Bugliesi, Massimo Fabris:
A New Fixpoint Semantics for Prolog. ICLP 1993: 374-389 - [c8]Annalisa Bossi, Michele Bugliesi, Maurizio Gabbrielli, Giorgio Levi, Maria Chiara Meo:
Differential Logic Programming. POPL 1993: 359-370 - 1992
- [j5]Annalisa Bossi, Silvio Valentini:
An Intuitionistic Theory of Types with Assumptions of High-Arity Variables. Ann. Pure Appl. Log. 57(2): 93-149 (1992) - [c7]Annalisa Bossi, Nicoletta Cocco, Massimo Fabris:
Typed Norms. ESOP 1992: 73-92 - [c6]Annalisa Bossi, Maurizio Gabbrielli, Giorgio Levi, Maria Chiara Meo:
Contributions to the Semantics of Open Logic Programs. FGCS 1992: 570-580 - [c5]Annalisa Bossi, Nicoletta Cocco, Sandro Etalle:
Transforming Normal Programs by Replacement. META 1992: 265-279 - [c4]Annalisa Bossi, Nicoletta Cocco, Sandro Etalle:
On Safe Folding. PLILP 1992: 172-186 - 1991
- [c3]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 - [c2]Annalisa Bossi, Nicoletta Cocco, Massimo Fabris:
Proving Termination of Logic Programs by Exploiting Term Properties. TAPSOFT, Vol.2 1991: 153-180 - 1990
- [j4]Annalisa Bossi, Nicoletta Cocco, Susi Dulli:
A Method for Specializing Logic Programs. ACM Trans. Program. Lang. Syst. 12(2): 253-302 (1990)
1980 – 1989
- 1989
- [c1]Annalisa Bossi, Nicoletta Cocco:
Verifying Correctness of Logic Programs. TAPSOFT, Vol.2 1989: 96-110 - 1984
- [j3]Annalisa Bossi, Carlo Ghezzi:
Using FP As a Query Language for Relational Data-Bases. Comput. Lang. 9(1): 25-37 (1984) - 1983
- [j2]Annalisa Bossi, Nicoletta Cocco, Livio Colussi:
A Divide-and-Conquer Approach to General Context-Free Parsing. Inf. Process. Lett. 16(4): 203-208 (1983) - 1980
- [j1]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): 35-40 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
