Nicoletta Cocco

Marta Simeoni

Proceedings of the fourth International Workshop on Interactions between Computer Science and Biology, 2013

Comparing metabolic pathways through potential fluxes: a selective opening approach.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Biological Processes & Petri Nets, 2013

2011

A valuable experience in logic programming.

[BibT_eX]

[DOI]

Intelligenza Artificiale, 2011

2010

Petri nets for modelling metabolic pathways: a survey.

[BibT_eX]

[DOI]

Nat. Comput., 2010

2008

A Valuable Experience in Computational Logic.

[BibT_eX]

[DOI]

Proceedings of the Il Milione (i.e. 2^6), 2008

2004

Declarative Semantics of Input Consuming Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development, 2004

2002

On modular termination proofs of general logic programs.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2002

Transformation Systems and Nondeclarative Properties.

[BibT_eX]

[DOI]

Proceedings of the Computational Logic: Logic Programming and Beyond, 2002

2001

Termination of Well-Typed Logic Programs.

[BibT_eX]

[DOI]

Sabina Rossi

Proceedings of the 3rd international ACM SIGPLAN conference on Principles and practice of declarative programming, 2001

1999

Termination of Well-Moded Programs.

[BibT_eX]

[DOI]

J. Log. Program., 1999

Transformation of Left Terminating Programs.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming Synthesis and Transformation, 1999

1998

Success in Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming Synthesis and Transformation, 1998

1997

Programs Without Failures.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming Synthesis and Transformation, 1997

1996

Simultaneous Replacement in Normal Programs.

[BibT_eX]

[DOI]

J. Log. Comput., 1996

Replacement Can Preserve Termination.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming Synthesis and Transformation, 1996

1995

Transformation of Left Terminating Programs: the Reordering Problem.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming Synthesis and Transformation, 1995

1994

Norms on Terms and their use in Proving Universal Termination of a Logic Program.

[BibT_eX]

[DOI]

Massimo Fabris

Theor. Comput. Sci., 1994

Preserving Universal Termination through Unfold/Fold.

[BibT_eX]

[DOI]

Proceedings of the Algebraic and Logic Programming, 4th International Conference, 1994

1993

Basic Transformation Operations which Preserve Computed Answer Substitutions of Logic Programs.

[BibT_eX]

[DOI]

J. Log. Program., 1993

1992

On Safe Folding.

[BibT_eX]

[DOI]

Proceedings of the Programming Language Implementation and Logic Programming, 1992

Transforming Normal Programs by Replacement.

[BibT_eX]

[DOI]

Proceedings of the Meta-Programming in Logic, 3rd International Workshop, 1992

Typed Norms.

[BibT_eX]

[DOI]

Massimo Fabris

Proceedings of the ESOP '92, 1992

1991

Proving Termination of Logic Programs by Exploiting Term Properties.

[BibT_eX]

[DOI]

Massimo Fabris

Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

1990

A Method for Specializing Logic Programs.

[BibT_eX]

[DOI]

Susi Dulli

ACM Trans. Program. Lang. Syst., 1990

1989

Verifying Correctness of Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

1985

The Ada Task System and Real-Time Applications: An Implementation Schema.

[BibT_eX]

[DOI]

Dino Mandrioli

Vitaliano Milanese

Comput. Lang., 1985

1983

A Divide-and-Conquer Approach to General Context-Free Parsing.

[BibT_eX]

[DOI]

Livio Colussi

Inf. Process. Lett., 1983

1982

A Mechanism for Exception Handling and Its Verification Rules.

[BibT_eX]

[DOI]