Annalisa Bossi

Available identifiers

zbMath Open bossi.annalisaDBLPb/AnnalisaBossiWikidataQ102352618 ScholiaQ102352618MaRDI QIDQ1035701

List of research outcomes

Publication	Date of Publication	Type
Termination of simply moded logic programs with dynamic scheduling	2017-07-12	Paper
Transforming processes to check and ensure information flow security	2011-05-06	Paper
A proof system for information flow security	2011-03-04	Paper
Theoretical Foundations and Semantics of Logic Programming	2010-07-20	Paper
Information flow security and recursive systems.	2010-02-23	Paper
S-semantics for logic programming: a retrospective look	2009-11-04	Paper
Action Refinement in Process Algebra and Security Issues	2009-01-22	Paper
Unwinding Conditions for Security in Imperative Languages	2008-04-24	Paper
Program Development in Computational Logic	2005-12-23	Paper
Verifying persistent security properties	2004-11-18	Paper
On modular termination proofs of general logic programs	2004-03-01	Paper
Properties of Input-Consuming Derivations	2004-03-01	Paper
https://portal.mardi4nfdi.de/entity/Q4414391	2003-07-25	Paper
https://portal.mardi4nfdi.de/entity/Q4707738	2003-06-11	Paper
https://portal.mardi4nfdi.de/entity/Q4537519	2002-07-01	Paper
Semantics of well-moded input consuming logic programs	2002-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q2767054	2002-01-28	Paper
https://portal.mardi4nfdi.de/entity/Q2763687	2002-01-21	Paper
https://portal.mardi4nfdi.de/entity/Q2736363	2001-08-29	Paper
https://portal.mardi4nfdi.de/entity/Q2723923	2001-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q4499239	2001-03-05	Paper
https://portal.mardi4nfdi.de/entity/Q4506390	2000-09-18	Paper
The s-semantics approach: Theory and applications	2000-08-14	Paper
Termination of well-moded programs	1999-07-20	Paper
https://portal.mardi4nfdi.de/entity/Q5688899	1997-03-19	Paper
Differential logic programs: Programming methodologies and semantics	1996-12-08	Paper
Simultaneous Replacement in Normal Programs	1996-03-17	Paper
A compositional semantics for logic programs	1994-11-29	Paper
Norms on terms and their use in proving universal termination of a logic program	1994-04-05	Paper
Basic transformation operations which preserve computed answer substitutions of logic programs	1994-01-13	Paper
An intuitionistic theory of types with assumptions of high-arity variables	1992-09-27	Paper
Using FP as a query language for relational data-bases	1984-01-01	Paper
A divide-and-conquer approach to general context-free parsing	1983-01-01	Paper

Research outcomes over time

This page was built for person: Annalisa Bossi