Skip to search formSkip to main contentSkip to account menu

Verifiable computing

Known as: Verified computing 
Verifiable computing (or verified computation or verified computing) is enabling a computer to offload the computation of some function, to other… 
Wikipedia (opens in a new tab)

Related topics

Related topics

21 relations
Boolean circuitClient–server modelCloud computingCode

Broader (2)

Distributed computingSecure communication

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Verified Reachability Analysis of Continuous Systems
Ordinary differential equations ODEs are often used to model the dynamics of often safety-critical continuous systems. This… 
Highly Cited
2014
Highly Cited
2014
PLAM: A privacy-preserving framework for local-area mobile social networks
In this paper, we propose a privacy-preserving framework, called PLAM, for local-area mobile social networks. The proposed PLAM… 
2013
2013
Efficient Rigorous Numerics for Higher-Dimensional PDEs via One-Dimensional Estimates
We present an efficient rigorous computational method which is an extension of the work Analytic Estimates and Rigorous… 
Highly Cited
2008
Highly Cited
2008
Rigorous Numerics for the Cahn-Hilliard Equation on the Unit Square
While the structure of the set of stationary solutions of the Cahn-Hilliard equation on one-dimensional domains is completely… 
Highly Cited
2008
Highly Cited
2008
Chaotic Braided Solutions via Rigorous Numerics: Chaos in the Swift-Hohenberg Equation
We prove that the stationary Swift–Hohenberg equation has chaotic dynamics on a critical energy level for a large (continuous… 
2008
2008
Fictitious Domain Approach Via Lagrange Multipliers with Least Squares Spectral Element Method
We consider the application of Fictitious Domain approach combined with Least Squares Spectral Elements for the numerical… 
2006
2006
Optimizing a Parallel Self-verified Method for Solving Linear Systems
Solvers for linear equation systems are commonly used in many different kinds of real applications, which deal with large… 
Highly Cited
2005
Highly Cited
2005
Rigorous Numerics for Global Dynamics: A Study of the Swift-Hohenberg Equation
This paper presents a rigorous numerical method for the study and verification of global dynamics. In particular, this method… 
Highly Cited
2004
Highly Cited
2004
Rigorous Numerics for Dissipative Partial Differential Equations II. Periodic Orbit for the Kuramoto–Sivashinsky PDE—A Computer-Assisted Proof
Abstract We present a method of self-consistent a priori bounds, which allows us to study rigorously the dynamics of dissipative… 
Highly Cited
1997
Highly Cited
1997
C++ Toolbox for Verified Computing I: Basic Numerical Problems Theory, Algorithms, and Programs
This C++ Toolbox for Verified Computing presents an extensive set of sophisticated tools for solving basic numerical problems… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)