2009 |
28 | EE | Alessio Coletta,
Roberta Gori,
Francesca Levi:
Approximating Probabilistic Behaviors of Biological Systems Using Abstract Interpretation.
Electr. Notes Theor. Comput. Sci. 229(1): 165-182 (2009) |
2006 |
27 | EE | Roberta Gori,
Francesca Levi:
An Analysis for Proving Temporal Properties of Biological Systems.
APLAS 2006: 234-252 |
2005 |
26 | EE | Roberta Gori,
Francesca Levi:
A New Occurrence Counting Analysis for BioAmbients.
APLAS 2005: 381-400 |
25 | EE | Roberta Gori,
Giorgio Levi:
On the verification of finite failure.
J. Comput. Syst. Sci. 71(4): 535-575 (2005) |
2004 |
24 | EE | Elisa Bertino,
Barbara Catania,
Roberta Gori:
Enhancing the expressive power of the U-Datalog language
CoRR cs.DB/0404003: (2004) |
23 | EE | Roberto Bagnara,
Roberta Gori,
Patricia M. Hill,
Enea Zaffanella:
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
CoRR cs.PL/0404055: (2004) |
22 | EE | Roberto Bagnara,
Roberta Gori,
Patricia M. Hill,
Enea Zaffanella:
Finite-tree analysis for constraint logic-based languages.
Inf. Comput. 193(2): 84-116 (2004) |
2003 |
21 | EE | Roberta Gori,
Giorgio Levi:
Properties of a Type Abstract Interpreter.
VMCAI 2003: 132-145 |
20 | EE | Marco Comini,
Roberta Gori,
Giorgio Levi,
Paolo Volpe:
Abstract interpretation based verification of logic programs.
Sci. Comput. Program. 49(1-3): 89-123 (2003) |
19 | | Roberta Gori:
An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
Theor. Comput. Sci. 290(1): 863-936 (2003) |
2002 |
18 | EE | Roberta Gori,
Giorgio Levi:
An Experiment in Type Inference and Verification by Abstract Interpretation.
VMCAI 2002: 225-239 |
2001 |
17 | EE | Roberto Bagnara,
Enea Zaffanella,
Roberta Gori,
Patricia M. Hill:
Boolean Functions for Finite-Tree Dependencies.
LPAR 2001: 579-594 |
16 | EE | Marco Comini,
Roberta Gori,
Giorgio Levi:
How to Transform an Analyzer into a Verifier.
LPAR 2001: 595-609 |
15 | EE | Roberto Bagnara,
Roberta Gori,
Patricia M. Hill,
Enea Zaffanella:
Finite-Tree Analysis for Constraint Logic-Based Languages.
SAS 2001: 165-184 |
14 | EE | Marco Comini,
Roberta Gori,
Giorgio Levi:
Logic programs as specifications in the inductive verification of logic programs.
Electr. Notes Theor. Comput. Sci. 48: (2001) |
13 | | Elisa Bertino,
Barbara Catania,
Roberta Gori:
Enhancing the expressive power of the U-Datalog language.
TPLP 1(1): 105-122 (2001) |
2000 |
12 | EE | Roberta Gori:
An Abstract Interpretation Approach to Termination of Logic Programs.
LPAR 2000: 362-380 |
11 | EE | Marco Comini,
Roberta Gori,
Giorgio Levi:
Assertion based Inductive Verification Methods for Logic Programs.
Electr. Notes Theor. Comput. Sci. 40: (2000) |
1999 |
10 | | Roberta Gori,
Giorgio Levi:
On the verification of finite failure.
APPIA-GULP-PRODE 1999: 197-212 |
9 | | Roberta Gori:
A fixpoint semantics for reasoning about finite failure.
APPIA-GULP-PRODE 1999: 529-544 |
8 | | Roberta Gori:
A Fixpoint Semantics for Reasoning about Finite Failure.
LPAR 1999: 238-257 |
7 | | Roberta Gori,
Giorgio Levi:
On the Verification of Finite Failure.
PPDP 1999: 311-327 |
6 | EE | Marco Comini,
Roberta Gori,
Giorgio Levi,
Paolo Volpe:
Abstract Interpretation based Verification of Logic Programs.
Electr. Notes Theor. Comput. Sci. 30(1): (1999) |
1998 |
5 | | Roberta Gori,
E. Lastres,
R. Moreno,
Fausto Spoto:
Aproximating the Well-Founded Semantics for Normal Logic Programs using Abstract Interpretation.
APPIA-GULP-PRODE 1998: 433-442 |
4 | EE | François Fages,
Roberta Gori:
Analysis of Normal Logic Programs.
SAS 1998: 82-98 |
1997 |
3 | | Roberta Gori,
Giorgio Levi:
Finite Failure is And-Compositional.
J. Log. Comput. 7(6): 753-776 (1997) |
1996 |
2 | | François Fages,
Roberta Gori:
A Hierarchy of Semantics for Normal Constraint Logic Programs.
ALP 1996: 77-91 |
1994 |
1 | | Roberta Gori,
Giorgio Levi:
Finite Failure is AND-Compositional.
GULP-PRODE (1) 1994: 464-478 |