Invariant generation for P-solvable loops with assignments

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

In a seminal work, Micciancio & Voulgaris (2010) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus may need exponen ...

Causal consistency is one of the most adopted consistency criteria for distributed implementations of data structures. It ensures that operations are executed at all sites according to their causal precedence. We address the issue of verifying automaticall ...

Let F 2 C[x; y; z] be a constant-degree polynomial, and let A; B; C subset of C be finite sets of size n. We show that F vanishes on at most O(n(11/6))points of the Cartesian product A X B X C, unless F has a special group-related form. This improves a the ...

We present a sampling theory for a class of binary images with finite rate of innovation (FRI). Every image in our model is the restriction of

\mathds{1}_{\{p\leq0\}}

to the image plane, where

\mathds{1}

denotes the indicator function and

p

is some r ...

Let k be a global field of characteristic not 2, and let f is an element of k[X] be an irreducible polynomial. We show that a non-degenerate quadratic space has an isometry with minimal polynomial f if and only if such an isometry exists over all the compl ...

We analyze the stability and accuracy of discrete least squares on multivariate polynomial spaces to approximate a given function depending on a multivariate random variable uniformly distributed on a hypercube. The polynomial approximation is calculated s ...

Motivated by the numerical treatment of parametric and stochastic PDEs, we analyze the least-squares method for polynomial approximation of multivariate functions based on random sampling according to a given probability measure. Recent work has shown that ...

Kinetic models of chemical reaction systems are typically represented in terms of state variables, such as concentrations, temperature and partial pressures [1]. These state variables in turn depend on the underlying reactions, transfer phenomena, and tran ...

In this paper, we carry out a numerical dispersion analysis for the linear two-dimensional elastodynamics equations approximated by means of NURBS-based Isogeometric Analysis in the framework of the Galerkin method; specifically, we consider the analysis o ...

We address adaptive multivariate polynomial approximation by means of the discrete least-squares method with random evaluations, to approximate in the L2 probability sense a smooth function depending on a random variable distributed according to a given pr ...

We address the problem of conditional termination, which is that of defining the set of initial configurations from which a given program always terminates. First we define the dual set, of initial configurations from which a non-terminating execution exis ...

We analyse the problem of approximating a multivariate function by discrete least-squares projection on a polynomial space starting from random, noise-free observations. An area of possible application of such technique is Uncertainty Quantification (UQ) f ...

Invariant generation for P-solvable loops with assignments

Chattez avec Graph Search

On compact representations of Voronoi cells of lattices

On verifying causal consistency

Polynomials Vanishing On Cartesian Products: The Elekes-Szabo Theorem Revisited

Sampling and Reconstruction of Shapes with Algebraic Boundaries

Isometries of quadratic spaces

Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets

Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs

Data Reconciliation in Open Reaction Systems using the Concept of Extents

Isogeometric numerical dispersion analysis for two-dimensional elastic wave propagation

Adaptive polynomial approximation by means of random discrete least squares

Deciding Conditional Termination

Analysis of Discrete L2 Projection on Polynomial Spaces with Random Evaluations