Annalisa Bossi

From MaRDI portal
Person:1035701

Available identifiers

zbMath Open bossi.annalisaDBLPb/AnnalisaBossiWikidataQ102352618 ScholiaQ102352618MaRDI QIDQ1035701

List of research outcomes





PublicationDate of PublicationType
Termination of simply moded logic programs with dynamic scheduling2017-07-12Paper
Transforming processes to check and ensure information flow security2011-05-06Paper
A proof system for information flow security2011-03-04Paper
Theoretical Foundations and Semantics of Logic Programming2010-07-20Paper
Information flow security and recursive systems.2010-02-23Paper
S-semantics for logic programming: a retrospective look2009-11-04Paper
Action Refinement in Process Algebra and Security Issues2009-01-22Paper
Unwinding Conditions for Security in Imperative Languages2008-04-24Paper
Program Development in Computational Logic2005-12-23Paper
Verifying persistent security properties2004-11-18Paper
On modular termination proofs of general logic programs2004-03-01Paper
Properties of Input-Consuming Derivations2004-03-01Paper
https://portal.mardi4nfdi.de/entity/Q44143912003-07-25Paper
https://portal.mardi4nfdi.de/entity/Q47077382003-06-11Paper
https://portal.mardi4nfdi.de/entity/Q45375192002-07-01Paper
Semantics of well-moded input consuming logic programs2002-03-19Paper
https://portal.mardi4nfdi.de/entity/Q27670542002-01-28Paper
https://portal.mardi4nfdi.de/entity/Q27636872002-01-21Paper
https://portal.mardi4nfdi.de/entity/Q27363632001-08-29Paper
https://portal.mardi4nfdi.de/entity/Q27239232001-07-08Paper
https://portal.mardi4nfdi.de/entity/Q44992392001-03-05Paper
https://portal.mardi4nfdi.de/entity/Q45063902000-09-18Paper
The s-semantics approach: Theory and applications2000-08-14Paper
Termination of well-moded programs1999-07-20Paper
https://portal.mardi4nfdi.de/entity/Q56888991997-03-19Paper
Differential logic programs: Programming methodologies and semantics1996-12-08Paper
Simultaneous Replacement in Normal Programs1996-03-17Paper
A compositional semantics for logic programs1994-11-29Paper
Norms on terms and their use in proving universal termination of a logic program1994-04-05Paper
Basic transformation operations which preserve computed answer substitutions of logic programs1994-01-13Paper
An intuitionistic theory of types with assumptions of high-arity variables1992-09-27Paper
Using FP as a query language for relational data-bases1984-01-01Paper
A divide-and-conquer approach to general context-free parsing1983-01-01Paper

Research outcomes over time

This page was built for person: Annalisa Bossi