default search action
Roberta Gori
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j28]Roberto Bruni, Roberta Gori, Paolo Milazzo, Hélène Siboulet:
Melding Boolean networks and reaction systems under synchronous, asynchronous and most permissive semantics. Nat. Comput. 23(2): 235-267 (2024) - [j27]Linda Brodo, Roberto Bruni, Moreno Falaschi, Roberta Gori, Paolo Milazzo, Valeria Montagna, Pasquale Pulieri:
Causal analysis of positive Reaction Systems. Int. J. Softw. Tools Technol. Transf. 26(4): 509-526 (2024) - [c47]Juliana Bowles, Linda Brodo, Roberto Bruni, Moreno Falaschi, Roberta Gori, Paolo Milazzo:
Enhancing Reaction Systems with Guards for Analysing Comorbidity Treatment Strategies. CMSB 2024: 27-44 - [e1]Roberta Gori
, Paolo Milazzo
Computational Methods in Systems Biology - 22nd International Conference, CMSB 2024, Pisa, Italy, September 16-18, 2024, Proceedings. Lecture Notes in Computer Science 14971, Springer 2024, ISBN 978-3-031-71670-6 [contents] - 2023
- [j26]Roberto Bruni, Roberto Giacobazzi, Roberta Gori, Francesco Ranzato:
A Correctness and Incorrectness Program Logic. J. ACM 70(2): 15:1-15:45 (2023) - [j25]Linda Brodo
Quantitative extensions of reaction systems based on SOS semantics. Neural Comput. Appl. 35(9): 6335-6359 (2023) - [c46]Mayuko Kori, Flavio Ascari, Filippo Bonchi, Roberto Bruni, Roberta Gori, Ichiro Hasuo:
Exploiting Adjoints in Property Directed Reachability Analysis. CAV (2) 2023: 41-63 - [c45]Flavio Ascari, Roberto Bruni, Roberta Gori:
Logics for Extensional, Locally Complete Analysis via Domain Refinements. ESOP 2023: 1-27 - [i9]Mayuko Kori, Flavio Ascari, Filippo Bonchi, Roberto Bruni, Roberta Gori, Ichiro Hasuo:
Exploiting Adjoints in Property Directed Reachability Analysis. CoRR abs/2307.02817 (2023) - [i8]Flavio Ascari, Roberto Bruni, Roberta Gori, Francesco Logozzo:
Sufficient Incorrectness Logic: SIL and Separation SIL. CoRR abs/2310.18156 (2023) - 2022
- [j24]Roberto Bagnara, Abramo Bagnara, Fabio Biselli, Michele Chiari
Correct approximation of IEEE 754 floating-point arithmetic for program verification. Constraints An Int. J. 27(1-2): 29-69 (2022) - [c44]Flavio Ascari, Roberto Bruni, Roberta Gori:
Limits and difficulties in the design of under-approximation abstract domains. FoSSaCS 2022: 21-39 - [c43]Roberto Bruni, Roberto Giacobazzi, Roberta Gori, Francesco Ranzato:
Abstract interpretation repair. PLDI 2022: 426-441 - [c42]Roberto Bruni, Roberta Gori, Nicolas Manini:
Deciding Program Properties via Complete Abstractions on Bounded Domains. SAS 2022: 175-200 - 2021
- [j23]Roberto Barbuti, Pasquale Bove, Roberta Gori, Damas P. Gruska
Encoding Threshold Boolean Networks into Reaction Systems for the Analysis of Gene Regulatory Networks. Fundam. Informaticae 179(2): 205-225 (2021) - [j22]Roberto Barbuti, Anna Bernasconi, Roberta Gori, Paolo Milazzo:
Characterization and computation of ancestors in reaction systems. Soft Comput. 25(3): 1683-1698 (2021) - [j21]Roberto Barbuti, Roberta Gori, Paolo Milazzo
Encoding Boolean networks into reaction systems for investigating causal dependencies in gene regulation. Theor. Comput. Sci. 881: 3-24 (2021) - [j20]Roberto Bagnara, Michele Chiari, Roberta Gori, Abramo Bagnara:
A Practical Approach to Verification of Floating-Point C/C++ Programs with math.h/cmath Functions. ACM Trans. Softw. Eng. Methodol. 30(1): 9:1-9:53 (2021) - [c41]Lucia Nasti
Analysis and Verification of Robustness Properties in Becker-Döring Model. DataMod 2021: 27-43 - [c40]Lucia Nasti
Formal characterization and efficient verification of a biological robustness property. FormaliSE@ICSE 2021: 13-18 - [c39]Roberto Bruni, Roberto Giacobazzi, Roberta Gori, Francesco Ranzato:
A Logic for Locally Complete Abstract Interpretations. LICS 2021: 1-13 - [c38]Linda Brodo, Roberto Bruni, Moreno Falaschi, Roberta Gori, Francesca Levi, Paolo Milazzo:
Exploiting Modularity of SOS Semantics to Define Quantitative Extensions of Reaction Systems. TPNC 2021: 15-32 - [i7]Lucia Nasti, Roberta Gori, Paolo Milazzo:
Formal characterization and efficient verification of a biological robustness property. CoRR abs/2104.13831 (2021) - [i6]Lucia Nasti, Roberta Gori, Paolo Milazzo, Federico Poloni:
Efficient Analysis of Chemical Reaction Networks Dynamics based on Input-Output Monotonicity. CoRR abs/2107.00289 (2021) - 2020
- [j19]Roberto Barbuti, Roberta Gori, Paolo Milazzo
A survey of gene regulatory networks modelling methods: from differential equations, to Boolean and qualitative bioinspired models. J. Membr. Comput. 2(3): 207-226 (2020) - [j18]Roberto Bruni, Roberto Giacobazzi, Roberta Gori, Isabel Garcia-Contreras
Abstract extensionality: on the properties of incomplete abstract interpretations. Proc. ACM Program. Lang. 4(POPL): 28:1-28:28 (2020)
2010 – 2019
- 2019
- [j17]Roberta Gori, Damas P. Gruska
Studying Opacity of Reaction Systems through Formula Based Predictors. Fundam. Informaticae 165(3-4): 303-319 (2019) - [c37]Roberta Gori, Paolo Milazzo, Lucia Nasti:
Towards an Efficient Verification Method for Monotonicity Properties of Chemical Reaction Networks. BIOINFORMATICS 2019: 250-257 - [i5]Roberto Bagnara, Abramo Bagnara, Fabio Biselli, Michele Chiari, Roberta Gori:
Correct Approximation of IEEE 754 Floating-Point Arithmetic for Program Verification. CoRR abs/1903.06119 (2019) - 2018
- [j16]Roberto Barbuti, Roberta Gori, Francesca Levi, Paolo Milazzo:
Generalized contexts for reaction systems: definition and study of dynamic causalities. Acta Informatica 55(3): 227-267 (2018) - [j15]Roberto Bruni, Roberto Giacobazzi, Roberta Gori
Code obfuscation against abstraction refinement attacks. Formal Aspects Comput. 30(6): 685-711 (2018) - [j14]Roberto Barbuti, Roberta Gori, Paolo Milazzo:
Predictors for flat membrane systems. Theor. Comput. Sci. 736: 79-102 (2018) - [c36]Roberto Barbuti, Pasquale Bove, Roberta Gori, Francesca Levi, Paolo Milazzo:
Simulating Gene Regulatory Networks using Reaction Systems. CS&P 2018 - [c35]Roberta Gori, Damas P. Gruska
Hidden States in Reaction Systems. CS&P 2018 - [c34]Lucia Nasti
Formalizing a Notion of Concentration Robustness for Biochemical Networks. STAF Workshops 2018: 81-97 - [c33]Roberto Barbuti, Anna Bernasconi, Roberta Gori, Paolo Milazzo:
Computing Preimages and Ancestors in Reaction Systems. TPNC 2018: 23-35 - [c32]Roberto Bruni, Roberto Giacobazzi, Roberta Gori:
Code Obfuscation Against Abstract Model Checking Attacks. VMCAI 2018: 94-115 - 2017
- [j13]Chiara Bodei, Linda Brodo, Roberta Gori
A static analysis for Brane Calculi providing global occurrence counting information. Theor. Comput. Sci. 696: 11-51 (2017) - [c31]Arnaud Gotlieb, Marine Louarn, Mari Nygård, Tomás Ruiz-López, Sagar Sen, Roberta Gori:
Constraint-Based Verification of a Mobile App Game Designed for Nudging People to Attend Cancer Screening. AAAI 2017: 4678-4685 - [c30]Roberto Barbuti, Roberta Gori, Paolo Milazzo
Multiset Patterns and Their Application to Dynamic Causalities in Membrane Systems. Int. Conf. on Membrane Computing 2017: 54-73 - 2016
- [j12]Roberto Barbuti, Roberta Gori, Francesca Levi, Paolo Milazzo
Specialized Predictor for Reaction Systems with Context Properties. Fundam. Informaticae 147(2-3): 173-191 (2016) - [j11]Roberto Bagnara, Matthieu Carlier, Roberta Gori, Arnaud Gotlieb:
Exploiting Binary Floating-Point Representations for Constraint Propagation. INFORMS J. Comput. 28(1): 31-46 (2016) - [j10]Roberto Barbuti, Roberta Gori, Francesca Levi, Paolo Milazzo
Investigating dynamic causalities in reaction systems. Theor. Comput. Sci. 623: 114-145 (2016) - [i4]Roberto Bagnara, Michele Chiari, Roberta Gori, Abramo Bagnara:
A Practical Approach to Interval Refinement for math.h/cmath Functions. CoRR abs/1610.07390 (2016) - 2015
- [j9]Chiara Bodei, Roberta Gori, Francesca Levi:
Causal static analysis for Brane Calculi. Theor. Comput. Sci. 587: 73-103 (2015) - [c29]Roberto Barbuti, Roberta Gori, Francesca Levi, Paolo Milazzo:
Specialized Predictor for Reaction Systems with Context Properties. CS&P 2015: 31-43 - [c28]Chiara Bodei, Linda Brodo, Roberta Gori, Diana Hermith
A Global Occurrence Counting Analysis for Brane Calculi. LOPSTR 2015: 179-200 - 2013
- [j8]Roberta Gori, Francesca Levi:
An analysis for proving probabilistic termination of biological systems. Theor. Comput. Sci. 471: 27-73 (2013) - [c27]Roberto Bagnara, Matthieu Carlier, Roberta Gori, Arnaud Gotlieb:
Symbolic Path-Oriented Test Data Generation for Floating-Point Programs. ICST 2013: 1-10 - [c26]Chiara Bodei
An Analysis for Causal Properties of Membrane Interactions. CS2Bio 2013: 15-31 - [i3]Roberto Bagnara, Matthieu Carlier, Roberta Gori, Arnaud Gotlieb:
Filtering Floating-Point Constraints by Maximum ULP. CoRR abs/1308.3847 (2013) - 2010
- [j7]Roberta Gori, Francesca Levi:
Abstract interpretation based verification of temporal properties for BioAmbients. Inf. Comput. 208(8): 869-921 (2010) - [c25]Chiara Bodei, Andrea Bracciali, Davide Chiarugi
A Taxonomy of Causality-Based Biological Properties. FBTC 2010: 116-133
2000 – 2009
- 2009
- [c24]Roberta Gori, Francesca Levi:
Abstract Interpretation for Probabilistic Termination of Biological Systems. MeCBIC 2009: 137-153 - 2008
- [c23]Alessio Coletta
Approximating Probabilistic Behaviors of Biological Systems Using Abstract Interpretation. FBTC@ICALP 2008: 165-182 - 2006
- [c22]Roberta Gori, Francesca Levi:
An Analysis for Proving Temporal Properties of Biological Systems. APLAS 2006: 234-252 - 2005
- [j6]Roberta Gori, Giorgio Levi:
On the verification of finite failure. J. Comput. Syst. Sci. 71(4): 535-575 (2005) - [c21]Roberta Gori, Francesca Levi:
A New Occurrence Counting Analysis for BioAmbients. APLAS 2005: 381-400 - 2004
- [j5]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
- [j4]Marco Comini
Abstract interpretation based verification of logic programs. Sci. Comput. Program. 49(1-3): 89-123 (2003) - [j3]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) - [c20]Roberta Gori, Giorgio Levi:
Properties of a Type Abstract Interpreter. VMCAI 2003: 132-145 - 2002
- [c19]Roberta Gori, Giorgio Levi:
An Experiment in Type Inference and Verification by Abstract Interpretation. VMCAI 2002: 225-239 - 2001
- [j2]Elisa Bertino, Barbara Catania, Roberta Gori:
Enhancing the expressive power of the U-Datalog language. Theory Pract. Log. Program. 1(1): 105-122 (2001) - [c18]Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella:
Finite-tree analysis for constraint logic-based languages. APPIA-GULP-PRODE 2001: 63-79 - [c17]Roberto Bagnara, Enea Zaffanella, Roberta Gori, Patricia M. Hill:
Boolean functions for finite-tree dependencies. APPIA-GULP-PRODE 2001: 81-96 - [c16]Marco Comini, Roberta Gori, Giorgio Levi:
How to transform an analyzer into a verifier. APPIA-GULP-PRODE 2001: 131-148 - [c15]Roberto Bagnara, Enea Zaffanella, Roberta Gori, Patricia M. Hill:
Boolean Functions for Finite-Tree Dependencies. LPAR 2001: 579-594 - [c14]Marco Comini
How to Transform an Analyzer into a Verifier. LPAR 2001: 595-609 - [c13]Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella:
Finite-Tree Analysis for Constraint Logic-Based Languages. SAS 2001: 165-184 - [c12]Marco Comini
Logic programs as specifications in the inductive verification of logic programs. APPIA-GULP-PRODE 2001: 131-146 - 2000
- [c11]Roberta Gori:
An Abstract Interpretation Approach to Termination of Logic Programs. LPAR 2000: 362-380 - [c10]Marco Comini
Assertion based Inductive Verification Methods for Logic Programs. MFCSIT 2000: 52-69
1990 – 1999
- 1999
- [c9]Roberta Gori, Giorgio Levi:
On the verification of finite failure. APPIA-GULP-PRODE 1999: 197-212 - [c8]Roberta Gori:
A fixpoint semantics for reasoning about finite failure. APPIA-GULP-PRODE 1999: 529-544 - [c7]Roberta Gori:
A Fixpoint Semantics for Reasoning about Finite Failure. LPAR 1999: 238-257 - [c6]Roberta Gori, Giorgio Levi:
On the Verification of Finite Failure. PPDP 1999: 311-327 - [c5]Marco Comini
Abstract Interpretation based Verification of Logic Programs. Verification of Logic Programs@ICLP 1999: 22-38 - 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]François Fages, Roberta Gori:
Analysis of Normal Logic Programs. SAS 1998: 82-98 - 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]Roberta Gori, Giorgio Levi:
Finite Failure is AND-Compositional. GULP-PRODE (1) 1994: 464-478
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: