Roberta Gori

Orcid: 0000-0002-7424-9576

According to our database1, Roberta Gori authored at least 67 papers between 1996 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A Correctness and Incorrectness Program Logic.
J. ACM, April, 2023

Quantitative extensions of reaction systems based on SOS semantics.
Neural Comput. Appl., March, 2023

Sufficient Incorrectness Logic: SIL and Separation SIL.
CoRR, 2023

Logics for Extensional, Locally Complete Analysis via Domain Refinements.
Proceedings of the Programming Languages and Systems, 2023

Exploiting Adjoints in Property Directed Reachability Analysis.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022
Correct approximation of IEEE 754 floating-point arithmetic for program verification.
Constraints An Int. J., 2022

Deciding Program Properties via Complete Abstractions on Bounded Domains.
Proceedings of the Static Analysis - 29th International Symposium, 2022

Abstract interpretation repair.
Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

Limits and difficulties in the design of under-approximation abstract domains.
Proceedings of the Foundations of Software Science and Computation Structures, 2022

2021
A Practical Approach to Verification of Floating-Point C/C++ Programs with math.h/cmath Functions.
ACM Trans. Softw. Eng. Methodol., 2021

Encoding Boolean networks into reaction systems for investigating causal dependencies in gene regulation.
Theor. Comput. Sci., 2021

Characterization and computation of ancestors in reaction systems.
Soft Comput., 2021

Encoding Threshold Boolean Networks into Reaction Systems for the Analysis of Gene Regulatory Networks.
Fundam. Informaticae, 2021

Efficient Analysis of Chemical Reaction Networks Dynamics based on Input-Output Monotonicity.
CoRR, 2021

Exploiting Modularity of SOS Semantics to Define Quantitative Extensions of Reaction Systems.
Proceedings of the Theory and Practice of Natural Computing, 2021

A Logic for Locally Complete Abstract Interpretations.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Formal characterization and efficient verification of a biological robustness property.
Proceedings of the 9th IEEE/ACM International Conference on Formal Methods in Software Engineering, 2021

Analysis and Verification of Robustness Properties in Becker-Döring Model.
Proceedings of the From Data to Models and Back, 2021

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

A survey of gene regulatory networks modelling methods: from differential equations, to Boolean and qualitative bioinspired models.
J. Membr. Comput., 2020

2019
Studying Opacity of Reaction Systems through Formula Based Predictors.
Fundam. Informaticae, 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

2018
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

2017
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

2016
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

2015
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

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

An Analysis for Causal Properties of Membrane Interactions.
Proceedings of the fourth International Workshop on Interactions between Computer Science and Biology, 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

2010
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

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

2008
Approximating Probabilistic Behaviors of Biological Systems Using Abstract Interpretation.
Proceedings of the Second Workshop From Biology to Concurrency and Back, 2008

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

2005
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

2004
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

2003
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

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

2001
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

2000
Assertion based Inductive Verification Methods for Logic Programs.
Proceedings of the First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, 2000

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

1999
Abstract Interpretation based Verification of Logic Programs.
Proceedings of the Workshop on Verification of Logic Programs 1999, 1999

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

1998
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

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

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


  Loading...