Annalisa Bossi

According to our database1, Annalisa Bossi authored at least 66 papers between 1980 and 2011.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2011
Analysis and verification of SMIL documents.
Multimedia Syst., 2011

A valuable experience in logic programming.
Intelligenza Artificiale, 2011

2010
Theoretical Foundations and Semantics of Logic Programming.
Proceedings of the A 25-Year Perspective on Logic Programming: Achievements of the Italian Association for Logic Programming, 2010

2009
S-semantics for logic programming: A retrospective look.
Theor. Comput. Sci., 2009

2008
A Valuable Experience in Computational Logic.
Proceedings of the Il Milione (i.e. 2ˆ6), 2008

2007
Compositional information flow security for concurrent programs.
Journal of Computer Security, 2007

Enriching SMIL with assertions for temporal validation.
Proceedings of the 15th International Conference on Multimedia 2007, 2007

Action Refinement in Process Algebra and Security Issues.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2007

2005
Information flow in secure contexts.
Journal of Computer Security, 2005

2004
Termination of simply moded logic programs with dynamic scheduling.
ACM Trans. Comput. Log., 2004

Unwinding in Information Flow Security.
Electr. Notes Theor. Comput. Sci., 2004

Verifying persistent security properties.
Computer Languages, Systems & Structures, 2004

Unwinding Conditions for Security in Imperative Languages.
Proceedings of the Logic Based Program Synthesis and Transformation, 2004

Declarative Semantics of Input Consuming Logic Programs.
Proceedings of the Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development, 2004

Modelling Downgrading in Information Flow Security.
Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004

2003
Bisimulation and Unwinding for Verifying Possibilistic Security Properties.
Proceedings of the Verification, 2003

Refinement Operators and Information Flow Security.
Proceedings of the 1st International Conference on Software Engineering and Formal Methods (SEFM 2003), 2003

Information Flow Security and Recursive Systems.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Secure Contexts for Confidential Data.
Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW-16 2003), 30 June, 2003

2002
Properties of input-consuming derivations.
TPLP, 2002

On modular termination proofs of general logic programs.
TPLP, 2002

A Proof System for Information Flow Security.
Proceedings of the Logic Based Program Synthesis and Tranformation, 2002

Transformation Systems and Nondeclarative Properties.
Proceedings of the Computational Logic: Logic Programming and Beyond, 2002

Transforming Processes to Check and Ensure Information Flow Security.
Proceedings of the Algebraic Methodology and Software Technology, 2002

2001
Properties of Input-Consuming Derivations
CoRR, 2001

Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling
CoRR, 2001

Termination of Well-Typed Logic Programs.
Proceedings of the 3rd international ACM SIGPLAN conference on Principles and practice of declarative programming, 2001

Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling.
Proceedings of the Programming Languages and Systems, 2001

2000
Composing Complete and Partial Knowledge.
Journal of Functional and Logic Programming, 2000

On Modular Termination Proofs of General Logic Programs
CoRR, 2000

Semantics of well-moded input-consuming logic programs.
Comput. Lang., 2000

Semantics of Input-Consuming Logic Programs.
Proceedings of the Computational Logic, 2000

1999
Properties of Input-Consuming Derivations.
Electr. Notes Theor. Comput. Sci., 1999

Termination of Well-Moded Programs.
J. Log. Program., 1999

Guest Editors' Introduction Special Issue: Synthesis, Transformation and Analysis of Logic Rrograms 2.
J. Log. Program., 1999

Transformation of Left Terminating Programs.
Proceedings of the Logic Programming Synthesis and Transformation, 1999

1998
Specialising Logic Programs with Respect to Call?Post Specifications.
Proceedings of the Logic Programming Synthesis and Transformation, 1998

Success in Logic Programs.
Proceedings of the Logic Programming Synthesis and Transformation, 1998

1997
Verification, Model Checking and Abstract Interpretation (Workshop Overview).
Proceedings of the Logic Programming, 1997

Programs Without Failures.
Proceedings of the Logic Programming Synthesis and Transformation, 1997

1996
Differential Logic Programs: Programming Methodologies and Semantics.
Sci. Comput. Program., 1996

Simultaneous Replacement in Normal Programs.
J. Log. Comput., 1996

Replacement Can Preserve Termination.
Proceedings of the Logic Programming Synthesis and Transformation, 1996

1995
Transformation of Left Terminating Programs: the Reordering Problem.
Proceedings of the Logic Programming Synthesis and Transformation, 1995

1994
Transforming Acyclic Programs.
ACM Trans. Program. Lang. Syst., 1994

A Compositional Semantics for Logic Programs.
Theor. Comput. Sci., 1994

Norms on Terms and their use in Proving Universal Termination of a Logic Program.
Theor. Comput. Sci., 1994

The s-Semantics Approach: Theory and Applications.
J. Log. Program., 1994

More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics.
Proceedings of the Logic Programming Synthesis and Transformation, 1994

A Bottom-up Semantics for Constructive Negation.
Proceedings of the Logic Programming, 1994

Preserving Universal Termination through Unfold/Fold.
Proceedings of the Algebraic and Logic Programming, 4th International Conference, 1994

1993
Basic Transformation Operations which Preserve Computed Answer Substitutions of Logic Programs.
J. Log. Program., 1993

Differential Logic Programming.
Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

A New Fixpoint Semantics for Prolog.
Proceedings of the Logic Programming, 1993

1992
An Intuitionistic Theory of Types with Assumptions of High-Arity Variables.
Ann. Pure Appl. Logic, 1992

On Safe Folding.
Proceedings of the Programming Language Implementation and Logic Programming, 1992

Transforming Normal Programs by Replacement.
Proceedings of the Meta-Programming in Logic, 3rd International Workshop, 1992

Contributions to the Semantics of Open Logic Programs.
Proceedings of the International Conference on Fifth Generation Computer Systems. FGCS 1992, 1992

Typed Norms.
Proceedings of the ESOP '92, 1992

1991
Proving Termination of Logic Programs by Exploiting Term Properties.
Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

An OR-Compositional Semantics for Logic Programs.
Proceedings of the Constructing Logic Programs, 1991

1990
A Method for Specializing Logic Programs.
ACM Trans. Program. Lang. Syst., 1990

1989
Verifying Correctness of Logic Programs.
Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

1984
Using FP As a Query Language for Relational Data-Bases.
Comput. Lang., 1984

1983
A Divide-and-Conquer Approach to General Context-Free Parsing.
Inf. Process. Lett., 1983

1980
Identifiability of compartmental models: algorithms to solve an actual problem by means of symbolic calculus.
ACM SIGSAM Bulletin, 1980


  Loading...