Arrow Research search

Author name cluster

Luca Cardelli

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

22 papers
2 author rows

Possible papers

22

JMLR Journal 2022 Journal Article

Adversarial Robustness Guarantees for Gaussian Processes

  • Andrea Patane
  • Arno Blaas
  • Luca Laurenti
  • Luca Cardelli
  • Stephen Roberts
  • Marta Kwiatkowska

Gaussian processes (GPs) enable principled computation of model uncertainty, making them attractive for safety-critical applications. Such scenarios demand that GP decisions are not only accurate, but also robust to perturbations. In this paper we present a framework to analyse adversarial robustness of GPs, defined as invariance of the model's decision to bounded perturbations. Given a compact subset of the input space $T\subseteq \mathbb{R}^d$, a point $x^*$ and a GP, we provide provable guarantees of adversarial robustness of the GP by computing lower and upper bounds on its prediction range in $T$. We develop a branch-and-bound scheme to refine the bounds and show, for any $\epsilon > 0$, that our algorithm is guaranteed to converge to values $\epsilon$-close to the actual values in finitely many iterations. The algorithm is anytime and can handle both regression and classification tasks, with analytical formulation for most kernels used in practice. We evaluate our methods on a collection of synthetic and standard benchmark data sets, including SPAM, MNIST and FashionMNIST. We study the effect of approximate inference techniques on robustness and demonstrate how our method can be used for interpretability. Our empirical results suggest that the adversarial robustness of GPs increases with accurate posterior estimation. [abs] [ pdf ][ bib ] [ code ] &copy JMLR 2022. ( edit, beta )

ICRA Conference 2020 Conference Paper

Uncertainty Quantification with Statistical Guarantees in End-to-End Autonomous Driving Control

  • Rhiannon Michelmore
  • Matthew Wicker
  • Luca Laurenti
  • Luca Cardelli
  • Yarin Gal
  • Marta Kwiatkowska

Deep neural network controllers for autonomous driving have recently benefited from significant performance improvements, and have begun deployment in the real world. Prior to their widespread adoption, safety guarantees are needed on the controller behaviour that properly take account of the uncertainty within the model as well as sensor noise. Bayesian neural networks, which assume a prior over the weights, have been shown capable of producing such uncertainty measures, but properties surrounding their safety have not yet been quantified for use in autonomous driving scenarios. In this paper, we develop a framework based on a state-of-the-art simulator for evaluating end-to-end Bayesian controllers. In addition to computing pointwise uncertainty measures that can be computed in real time and with statistical guarantees, we also provide a method for estimating the probability that, given a scenario, the controller keeps the car safe within a finite horizon. We experimentally evaluate the quality of uncertainty computation by three Bayesian inference methods in different scenarios and show how the uncertainty measures can be combined and calibrated for use in collision avoidance. Our results suggest that uncertainty estimates can greatly aid decision making in autonomous driving.

TCS Journal 2019 Journal Article

Comparing chemical reaction networks: A categorical and algorithmic perspective

  • Luca Cardelli
  • Mirco Tribastone
  • Max Tschaikowski
  • Andrea Vandin

We study chemical reaction networks (CRNs) as a kernel model of concurrency provided with semantics based on ordinary differential equations. We investigate the problem of comparing two CRNs, i. e. , to decide whether the solutions of a source and of a target CRN can be matched for an appropriate choice of initial conditions. Using a categorical framework, we extend and unify model-comparison approaches based on dynamical (semantic) and structural (syntactic) properties of CRNs. Then, we provide an algorithm to compare CRNs, running linearly in time with respect to the cardinality of all possible comparisons. Finally, using a prototype implementation, CAGE, we apply our results to biological models from the literature.

AAAI Conference 2019 Conference Paper

Robustness Guarantees for Bayesian Inference with Gaussian Processes

  • Luca Cardelli
  • Marta Kwiatkowska
  • Luca Laurenti
  • Andrea Patane

Bayesian inference and Gaussian processes are widely used in applications ranging from robotics and control to biological systems. Many of these applications are safety-critical and require a characterization of the uncertainty associated with the learning model and formal guarantees on its predictions. In this paper we define a robustness measure for Bayesian inference against input perturbations, given by the probability that, for a test point and a compact set in the input space containing the test point, the prediction of the learning model will remain δ−close for all the points in the set, for δ > 0. Such measures can be used to provide formal probabilistic guarantees for the absence of adversarial examples. By employing the theory of Gaussian processes, we derive upper bounds on the resulting robustness by utilising the Borell-TIS inequality, and propose algorithms for their computation. We evaluate our techniques on two examples, a GP regression problem and a fully-connected deep neural network, where we rely on weak convergence to GPs to study adversarial examples on the MNIST dataset.

IJCAI Conference 2019 Conference Paper

Statistical Guarantees for the Robustness of Bayesian Neural Networks

  • Luca Cardelli
  • Marta Kwiatkowska
  • Luca Laurenti
  • Nicola Paoletti
  • Andrea Patane
  • Matthew Wicker

We introduce a probabilistic robustness measure for Bayesian Neural Networks (BNNs), defined as the probability that, given a test point, there exists a point within a bounded set such that the BNN prediction differs between the two. Such a measure can be used, for instance, to quantify the probability of the existence of adversarial examples. Building on statistical verification techniques for probabilistic models, we develop a framework that allows us to estimate probabilistic robustness for a BNN with statistical guarantees, i. e. , with a priori error and confidence bounds. We provide experimental comparison for several approximate BNN inference techniques on image classification tasks associated to MNIST and a two-class subset of the GTSRB dataset. Our results enable quantification of uncertainty of BNN predictions in adversarial settings.

TCS Journal 2019 Journal Article

Symbolic computation of differential equivalences

  • Luca Cardelli
  • Mirco Tribastone
  • Max Tschaikowski
  • Andrea Vandin

Ordinary differential equations (ODEs) are widespread in many natural sciences including chemistry, ecology, and systems biology, and in disciplines such as control theory and electrical engineering. Building on the celebrated molecules-as-processes paradigm, they have become increasingly popular in computer science, with high-level languages and formal methods such as Petri nets, process algebra, and rule-based systems that are interpreted as ODEs. We consider the problem of comparing and minimizing ODEs automatically. Influenced by traditional approaches in the theory of programming, we propose differential equivalence relations. We study them for a basic intermediate language, for which we have decidability results, that can be targeted by a class of high-level specifications. An ODE implicitly represents an uncountable state space, hence reasoning techniques cannot be borrowed from established domains such as probabilistic programs with finite-state Markov chain semantics. We provide novel symbolic procedures to check an equivalence and compute the largest one via partition refinement algorithms that use satisfiability modulo theories. We illustrate the generality of our framework by showing that differential equivalences include (i) well-known notions for the minimization of continuous-time Markov chains (lumpability), (ii) bisimulations for chemical reaction networks recently proposed by Cardelli et al. , and (iii) behavioral relations for process algebra with ODE semantics. Using ERODE, the tool that implements our techniques, we are able to detect equivalences in biochemical models from the literature that cannot be reduced using competing automatic techniques.

TCS Journal 2012 Journal Article

Processes in space

  • Luca Cardelli
  • Philippa Gardner

We introduce a geometric process algebra based on affine geometry, with the aim of describing the concurrent evolution of geometric structures in 3D space. We prove a relativity theorem stating that algebraic equations are invariant under rigid body transformations.

CSL Conference 2011 Conference Paper

Continuous Markovian Logic - From Complete Axiomatization to the Metric Space of Formulas

  • Luca Cardelli
  • Kim G. Larsen
  • Radu Mardare

Continuous Markovian Logic (CML) is a multimodal logic that expresses quantitative and qualitative properties of continuous-space and continuous-time labelled Markov processes (CMPs). The modalities of CML approximate the rates of the exponentially distributed random variables that characterize the duration of the labeled transitions. In this paper we present a sound and complete Hilbert-style axiomatization of CML for the CMP-semantics and prove some metaproperties including the small model property. CML characterizes stochastic bisimulation and supports the definition of a quantified extension of satisfiability relation that measures the compatibility of a model and a property. Relying on the small model property, we prove that this measure can be approximated, within a given error, by using a distance between logical formulas.

TCS Journal 2009 Journal Article

A process model of Rho GTP-binding proteins

  • Luca Cardelli
  • Emmanuelle Caron
  • Philippa Gardner
  • Ozan Kahramanoğulları
  • Andrew Phillips

Rho GTP-binding proteins play a key role as molecular switches in many cellular activities. In response to extracellular stimuli and with the help of regulators (GEF, GAP, Effector, GDI), these proteins serve as switches that interact with their environment in a complex manner. Based on the structure of a published ordinary differential equations (ODE) model, we first present a generic process model for the Rho GTP-binding proteins, and compare it with the ODE model. We then extend the basic model to include the behaviour of the GDI regulators and explore the parameter space for the extended model with respect to biological data from the literature. We discuss the challenges this extension brings and the directions of further research. In particular, we present techniques for modular representation and refinement of process models, where, for example, different Rho proteins with different rates for regulator interactions can be given as instances of the same parametric model.

TCS Journal 2008 Journal Article

Bitonal membrane systems

  • Luca Cardelli

Inspired by the alternating orientations of cellular membranes, we describe a structure of nested membranes that are colored in two alternating tones. We investigate a class of reactions that maintain the colored regions largely invariant at each step (bitonal reactions). These coloring constraints guide us towards a small and non-obvious set of basic reactions that are both realistic and complete. They are realistic because bitonality is related to an independent notion of locality, and because similar reactions are implemented by molecular machinery. They are complete because any bitonal reaction can be obtained from them. Such a set of reactions can then be used as the basis for descriptions of biological processes, and in particular for the description of transport networks in cellular biology.

CSL Conference 2008 Invited Paper

Molecules as Automata

  • Luca Cardelli

Abstract Molecular biology investigates the structure and function of biochemical systems starting from their basic building blocks: macromolecules. A macromolecule is a large, complex molecule (a protein or a nucleic acid) that usually has inner mutable state and external activity. Informal explanations of biochemical events trace individual macromolecules through their state changes and their interaction histories: a macromolecule is endowed with an identity that is retained through its transformations, even through changes in molecular energy and mass. A macromolecule, therefore, is qualitatively different from the small molecules of inorganic chemistry. Such molecules are stateless: in the standard notation for chemical reactions they are seemingly created and destroyed, and their atomic structure is used mainly for the bookkeeping required by the conservation of mass.

TCS Journal 2008 Journal Article

On process rate semantics

  • Luca Cardelli

We provide translations between process algebra and systems of chemical reactions. We show that the translations preserve discrete-state (stochastic) and continuous-state (concentration) semantics, and in particular that the continuous-state semantics of processes corresponds to the differential equations of chemistry based on the law of mass action. The novel semantics of processes so obtained equates processes that have the same state occupation dynamics, but which may have different interaction interfaces.

I&C Journal 2005 Journal Article

Secrecy and group creation

  • Luca Cardelli
  • Giorgio Ghelli
  • Andrew D. Gordon

We add an operation of group creation to the typed π-calculus, where a group is a type for channels. Creation of fresh groups has the effect of statically preventing certain communications, and can block the accidental or malicious leakage of secrets. Intuitively, no channel belonging to a fresh group can be received by processes outside the initial scope of the group, even if those processes are untyped. We formalize this intuition by adapting a notion of secrecy introduced by Abadi, and proving a preservation of secrecy property.

TCS Journal 2004 Journal Article

A spatial logic for concurrency—II

  • Luı́s Caires
  • Luca Cardelli

We present a modal logic for describing the spatial organization and the behavior of distributed systems. In addition to standard logical and temporal operators, our logic includes spatial operations corresponding to process composition and name hiding, and a fresh name quantifier. In Part I of this work we study the fundamental semantic properties of our logic; the focus of the present Part II is on proof theory. The main contributions are a sequent-based proof system for our logic, and a proof of cut-elimination for its first-order fragment.

TCS Journal 2004 Journal Article

BioAmbients: an abstraction for biological compartments

  • Aviv Regev
  • Ekaterina M. Panina
  • William Silverman
  • Luca Cardelli
  • Ehud Shapiro

Biomolecular systems, composed of networks of proteins, underlie the major functions of living cells. Compartments are key to the organization of such systems. We have previously developed an abstraction for biomolecular systems using the π-calculus process algebra, which successfully handled their molecular and biochemical aspects, but provided only a limited solution for representing compartments. In this work, we extend this abstraction to handle compartments. We are motivated by the ambient calculus, a process algebra for the specification of process location and movement through computational domains. We present the BioAmbients calculus, which is suitable for representing various aspects of molecular localization and compartmentalization, including the movement of molecules between compartments, the dynamic rearrangement of cellular compartments, and the interaction between molecules in a compartmentalized setting. Guided by the calculus, we adapt the BioSpi simulation system, to provide an extended modular framework for molecular and cellular compartmentalization, and we use it to model and study a complex multi-cellular system.

I&C Journal 2003 Journal Article

A spatial logic for concurrency (part I)

  • Luı́s Caires
  • Luca Cardelli

We present a logic that can express properties of freshness, secrecy, structure, and behavior of concurrent systems. In addition to standard logical and temporal operators, our logic includes spatial operations corresponding to composition, local name restriction, and a primitive fresh name quantifier. Properties can also be defined by recursion; a central aim of this paper is then the combination of a logical notion of freshness with inductive and coinductive definitions of properties.

I&C Journal 2002 Journal Article

Types for the Ambient Calculus

  • Luca Cardelli
  • Giorgio Ghelli
  • Andrew D. Gordon

The ambient calculus is a concurrent calculus where the unifying notion of ambient is used to model many different constructs for distributed and mobile computation. We study a type system that describes several properties of ambient behavior. The type system allows ambients to be partitioned in disjoint sets (groups), according to the intended design of a system, in order to specify both the communication and the mobility behavior of ambients.

TCS Journal 2000 Journal Article

Mobile ambients

  • Luca Cardelli
  • Andrew D. Gordon

We introduce a calculus describing the movement of processes and devices, including movement through administrative domains.

I&C Journal 1999 Journal Article

Comparing Object Encodings

  • Kim B. Bruce
  • Luca Cardelli
  • Benjamin C. Pierce

Recent years have seen the development of several foundational models for statically typed object-oriented programming. But despite their intuitive similarity, differences in the technical machinery used to formulate the various proposals have made them difficult to compare. Using the typed lambda-calculus F ω <: as a common basis, we now offer a detailed comparison of four models: (1) a recursive-record encoding similar to the ones used by Cardelli, Reddy, Cook, and others; (2) Hofmann, Pierce, and Turner's existential encoding; (3) Bruce's model based on existential and recursive types; and (4) Abadi, Cardelli, and Viswanathan's type-theoretic encoding of a calculus of primitive objects.

v2026.09.13