| 2013 | ||
|---|---|---|
| j12 | Roberta Gori, Francesca Levi: An analysis for proving probabilistic termination of biological systems. Theor. Comput. Sci. 471: 27-73 (2013) | |
| 2010 | ||
| j11 | Roberta Gori, Francesca Levi: Abstract interpretation based verification of temporal properties for BioAmbients. Inf. Comput. 208(8): 869-921 (2010) | |
| c18 | Chiara Bodei, Andrea Bracciali, Davide Chiarugi, Roberta Gori: A Taxonomy of Causality-Based Biological Properties. FBTC 2010: 116-133 | |
| 2009 | ||
| j10 | 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) | |
| c17 | Roberta Gori, Francesca Levi: Abstract Interpretation for Probabilistic Termination of Biological Systems. MeCBIC 2009: 137-153 | |
| 2006 | ||
| c16 | Roberta Gori, Francesca Levi: An Analysis for Proving Temporal Properties of Biological Systems. APLAS 2006: 234-252 | |
| 2005 | ||
| j9 | Roberta Gori, Giorgio Levi: On the verification of finite failure. J. Comput. Syst. Sci. 71(4): 535-575 (2005) | |
| c15 | Roberta Gori, Francesca Levi: A New Occurrence Counting Analysis for BioAmbients. APLAS 2005: 381-400 | |
| 2004 | ||
| j8 | Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella: Finite-tree analysis for constraint logic-based languages. Inf. Comput. 193(2): 84-116 (2004) | |
| i2 | Elisa Bertino, Barbara Catania, Roberta Gori: Enhancing the expressive power of the U-Datalog language. CoRR cs.DB/0404003 (2004) | |
| i1 | 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) | |
| 2003 | ||
| j7 | Marco Comini, Roberta Gori, Giorgio Levi, Paolo Volpe: Abstract interpretation based verification of logic programs. Sci. Comput. Program. 49(1-3): 89-123 (2003) | |
| j6 | 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) | |
| c14 | ||
| 2002 | ||
| c13 | Roberta Gori, Giorgio Levi: An Experiment in Type Inference and Verification by Abstract Interpretation. VMCAI 2002: 225-239 | |
| 2001 | ||
| j5 | Marco Comini, Roberta Gori, Giorgio Levi: Logic programs as specifications in the inductive verification of logic programs. Electr. Notes Theor. Comput. Sci. 48: 131-146 (2001) | |
| j4 | Elisa Bertino, Barbara Catania, Roberta Gori: Enhancing the expressive power of the U-Datalog language. TPLP 1(1): 105-122 (2001) | |
| c12 | Roberto Bagnara, Enea Zaffanella, Roberta Gori, Patricia M. Hill: Boolean Functions for Finite-Tree Dependencies. LPAR 2001: 579-594 | |
| c11 | Marco Comini, Roberta Gori, Giorgio Levi: How to Transform an Analyzer into a Verifier. LPAR 2001: 595-609 | |
| c10 | Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella: Finite-Tree Analysis for Constraint Logic-Based Languages. SAS 2001: 165-184 | |
| 2000 | ||
| j3 | Marco Comini, Roberta Gori, Giorgio Levi: Assertion based Inductive Verification Methods for Logic Programs. Electr. Notes Theor. Comput. Sci. 40: 52-69 (2000) | |
| c9 | Roberta Gori: An Abstract Interpretation Approach to Termination of Logic Programs. LPAR 2000: 362-380 | |
| 1999 | ||
| j2 | Marco Comini, Roberta Gori, Giorgio Levi, Paolo Volpe: Abstract Interpretation based Verification of Logic Programs. Electr. Notes Theor. Comput. Sci. 30(1): 22-38 (1999) | |
| c8 | ||
| c7 | Roberta Gori: A fixpoint semantics for reasoning about finite failure. APPIA-GULP-PRODE 1999: 529-544 | |
| c6 | ||
| c5 | ||
| 1998 | ||
| c4 | 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 | |
| c3 | ||
| 1997 | ||
| j1 | Roberta Gori, Giorgio Levi: Finite Failure is And-Compositional. J. Log. Comput. 7(6): 753-776 (1997) | |
| 1996 | ||
| c2 | François Fages, Roberta Gori: A Hierarchy of Semantics for Normal Constraint Logic Programs. ALP 1996: 77-91 | |
| 1994 | ||
| c1 | ||
Colors in the list of coauthors
Last update Sun May 26 04:36:15 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page