A Valuable Experience in Computational Logic

Il Milione: A Journey in the Computational Logic in Italy 65 SOMMARIO/ABSTRACT Illustriamo qui brevemente la nostra esperienza nel campo della verifica e delle trasformazioni dei programmi logici. Pur occupandoci ora di tematiche completamente diverse, verifica di proprietà di sicurezza da un lato e analisi di sistemi biologici dall'altro, continuiamo ad utilizzare proficuamente la nostra precedente esperienza. In this paper, we briefly describe our esperience in the field of verification and transformation of logic programming. Though now we are working in a completely different field, verification of security properties on one hand and biosys-tems analysis on the other, our previous experience continues to be a valuable guide.

[1]  Sandro Etalle,et al.  Properties of input-consuming derivations , 2002, Theory Pract. Log. Program..

[2]  Annalisa Bossi,et al.  Verifying Correctness of Logic Programs , 1989, TAPSOFT, Vol.2.

[3]  Annalisa Bossi,et al.  Typed Norms , 1992, ESOP.

[4]  Riccardo Focardi,et al.  A Proof System for Information Flow Security , 2002, LOPSTR.

[5]  Sandro Etalle,et al.  Simultaneous Replacement in Normal Programs , 1996, J. Log. Comput..

[6]  Carla Piazza,et al.  Compositional information flow security for concurrent programs , 2007, J. Comput. Secur..

[7]  Annalisa Bossi,et al.  Programs Without Failures , 1997, LOPSTR.

[8]  Annalisa Bossi,et al.  Proving Termination of Logic Programs by Exploiting Term Properties , 1991, TAPSOFT, Vol.2.

[9]  Annalisa Bossi,et al.  Basic Transformation Operations which Preserve Computed Answer Substitutions of Logic Programs , 1993, J. Log. Program..

[10]  Annalisa Bossi,et al.  Termination of well-typed logic programs , 2001, PPDP '01.

[11]  Annalisa Bossi,et al.  Replacement Can Preserve Termination , 1996, LOPSTR.

[12]  Sandro Etalle,et al.  Semantics of well-moded input-consuming logic programs , 2000, Comput. Lang..

[13]  Sandro Etalle,et al.  On modular termination proofs of general logic programs , 2002, Theory Pract. Log. Program..

[14]  Sandro Etalle,et al.  Declarative Semantics of Input Consuming Logic Programs , 2004, Program Development in Computational Logic.

[15]  Sandro Etalle,et al.  Transforming Normal Programs by Replacement , 1992, META.

[16]  Sandro Etalle,et al.  Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling , 2001, ESOP.

[17]  Maurizio Gabbrielli,et al.  The s-Semantics Approach: Theory and Applications , 1994, J. Log. Program..

[18]  Sandro Etalle,et al.  On Safe Folding , 1992, PLILP.

[19]  Carla Piazza,et al.  Information flow in secure contexts , 2005, J. Comput. Secur..

[20]  Annalisa Bossi,et al.  Norms on Terms and their use in Proving Universal Termination of a Logic Program , 1994, Theor. Comput. Sci..

[21]  Annalisa Bossi,et al.  A method for specializing logic programs , 1990, TOPL.

[22]  Sandro Etalle,et al.  Transforming acyclic programs , 1994, TOPL.

[23]  Sandro Etalle,et al.  Transformation Systems and Nondeclarative Properties , 2002, Computational Logic: Logic Programming and Beyond.

[24]  Annalisa Bossi,et al.  Success in Logic Programs , 1998, LOPSTR.

[25]  Riccardo Focardi,et al.  Verifying persistent security properties , 2004, Comput. Lang. Syst. Struct..

[26]  Sandro Etalle,et al.  Transformation of Left Terminating Programs: the Reordering Problem , 1995, LOPSTR.

[27]  Maurizio Gabbrielli,et al.  A Compositional Semantics for Logic Programs , 1994, Theor. Comput. Sci..

[28]  Alberto Martelli,et al.  A Journey in the Computational Logic in Italy , 2009 .

[29]  Sandro Etalle,et al.  Transformation of Left Terminating Programs , 1999, LOPSTR.

[30]  Sandro Etalle,et al.  Termination of Well-Moded Programs , 1999, J. Log. Program..

[31]  Annalisa Bossi,et al.  Preserving Universal Termination through Unfold/Fold , 1994, ALP.