Soundness

Soundness is a property of interactive proof systems that requires that no prover can make the verifier accept for a wrong statement except with some… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1937-2018
020040019372017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
We study the problem of verifiable computation (VC) in which a computationally weak client wishes to delegate the computation of… (More)
  • figure 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper studies finitary modal logics, interpreted over coalgebras for an endofunctor, and establishes soundness, completeness… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Two distinct, rigorous views of cryptography have developed over the years, in two mostly separate communities. One of the views… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
  • Don Syme
  • Formal Syntax and Semantics of Java
  • 1999
This technical report describes a machine checked proof of the type soundness of a subset of the Java language called JavaS . A… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Ensuring secure information ow within programs in the context of multiple sensitivity levels has been widely studied. Especially… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
A polymorphic, constraint-based type inference algorithm for an object-oriented language is defined. A generalized form of type… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We present a new approach to proving type soundness for Hindley/Milner-style polymorphic type systems. The keys to our approach… (More)
Is this relevant?
Highly Cited
1978
Highly Cited
1978
K. R. Apt pointed out to me that Theorem 3 (completeness) is technically false, because of a problem with initializing newly… (More)
Is this relevant?