Roberta Gori

According to our database1, Roberta Gori authored at least 49 papers between 1996 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 




Abstract extensionality: on the properties of incomplete abstract interpretations.
Proc. ACM Program. Lang., 2020

Studying Opacity of Reaction Systems through Formula Based Predictors.
Fundam. Informaticae, 2019

Correct Approximation of IEEE 754 Floating-Point Arithmetic for Program Verification.
CoRR, 2019

Towards an Efficient Verification Method for Monotonicity Properties of Chemical Reaction Networks.
Proceedings of the 12th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2019), 2019

Predictors for flat membrane systems.
Theor. Comput. Sci., 2018

Code obfuscation against abstraction refinement attacks.
Formal Aspects Comput., 2018

Generalized contexts for reaction systems: definition and study of dynamic causalities.
Acta Informatica, 2018

Code Obfuscation Against Abstract Model Checking Attacks.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2018

Computing Preimages and Ancestors in Reaction Systems.
Proceedings of the Theory and Practice of Natural Computing - 7th International Conference, 2018

Formalizing a Notion of Concentration Robustness for Biochemical Networks.
Proceedings of the Software Technologies: Applications and Foundations, 2018

Hidden States in Reaction Systems.
Proceedings of the 27th International Workshop on Concurrency, 2018

Simulating Gene Regulatory Networks using Reaction Systems.
Proceedings of the 27th International Workshop on Concurrency, 2018

A static analysis for Brane Calculi providing global occurrence counting information.
Theor. Comput. Sci., 2017

Multiset Patterns and Their Application to Dynamic Causalities in Membrane Systems.
Proceedings of the Membrane Computing, 2017

Constraint-Based Verification of a Mobile App Game Designed for Nudging People to Attend Cancer Screening.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Investigating dynamic causalities in reaction systems.
Theor. Comput. Sci., 2016

Exploiting Binary Floating-Point Representations for Constraint Propagation.
INFORMS J. Comput., 2016

Specialized Predictor for Reaction Systems with Context Properties.
Fundam. Informaticae, 2016

A Practical Approach to Interval Refinement for math.h/cmath Functions.
CoRR, 2016

Causal static analysis for Brane Calculi.
Theor. Comput. Sci., 2015

A Global Occurrence Counting Analysis for Brane Calculi.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2015

An analysis for proving probabilistic termination of biological systems.
Theor. Comput. Sci., 2013

An Analysis for Causal Properties of Membrane Interactions.
Electron. Notes Theor. Comput. Sci., 2013

Filtering Floating-Point Constraints by Maximum ULP.
CoRR, 2013

Symbolic Path-Oriented Test Data Generation for Floating-Point Programs.
Proceedings of the Sixth IEEE International Conference on Software Testing, 2013

Abstract interpretation based verification of temporal properties for BioAmbients.
Inf. Comput., 2010

A Taxonomy of Causality-Based Biological Properties
Proceedings of the Proceedings Third Workshop From Biology To Concurrency and back, 2010

Approximating Probabilistic Behaviors of Biological Systems Using Abstract Interpretation.
Electron. Notes Theor. Comput. Sci., 2009

Abstract Interpretation for Probabilistic Termination of Biological Systems
Proceedings of the Proceedings Third Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2009

An Analysis for Proving Temporal Properties of Biological Systems.
Proceedings of the Programming Languages and Systems, 4th Asian Symposium, 2006

On the verification of finite failure.
J. Comput. Syst. Sci., 2005

A New Occurrence Counting Analysis for BioAmbients.
Proceedings of the Programming Languages and Systems, Third Asian Symposium, 2005

Finite-tree analysis for constraint logic-based languages.
Inf. Comput., 2004

Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
CoRR, 2004

An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
Theor. Comput. Sci., 2003

Properties of a Type Abstract Interpreter.
Proceedings of the Verification, 2003

An Experiment in Type Inference and Verification by Abstract Interpretation.
Proceedings of the Verification, 2002

Enhancing the expressive power of the U-Datalog language.
Theory Pract. Log. Program., 2001

Logic programs as specifications in the inductive verification of logic programs.
Proceedings of the Declarative Programming, 2001

How to Transform an Analyzer into a Verifier.
Proceedings of the Logic for Programming, 2001

Boolean Functions for Finite-Tree Dependencies.
Proceedings of the Logic for Programming, 2001

Assertion based Inductive Verification Methods for Logic Programs.
Electron. Notes Theor. Comput. Sci., 2000

An Abstract Interpretation Approach to Termination of Logic Programs.
Proceedings of the Logic for Programming and Automated Reasoning, 2000

Abstract Interpretation based Verification of Logic Programs.
Electron. Notes Theor. Comput. Sci., 1999

A Fixpoint Semantics for Reasoning about Finite Failure.
Proceedings of the Logic Programming and Automated Reasoning, 6th International Conference, 1999

Analysis of Normal Logic Programs.
Proceedings of the Static Analysis, 5th International Symposium, 1998

Aproximating the Well-Founded Semantics for Normal Logic Programs using Abstract Interpretation.
Proceedings of the 1998 Joint Conference on Declarative Programming, 1998

Finite Failure is And-Compositional.
J. Log. Comput., 1997

A Hierarchy of Semantics for Normal Constraint Logic Programs.
Proceedings of the Algebraic and Logic Programming, 5th International Conference, 1996