Sciweavers

2137 search results - page 87 / 428
» Proving Abstract Non-interference
Sort
View
FMOODS
2008
14 years 11 months ago
Semantic Foundations and Inference of Non-null Annotations
This paper proposes a semantics-based automatic null pointer analysis for inferring non-null annotations of fields in objectoriented programs. The analysis is formulated for a mini...
Laurent Hubert, Thomas P. Jensen, David Pichardie
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 10 months ago
On the Stability of Empirical Risk Minimization in the Presence of Multiple Risk Minimizers
Abstract--Recently Kutin and Niyogi investigated several notions of algorithmic stability--a property of a learning map conceptually similar to continuity--showing that training-st...
Benjamin I. P. Rubinstein, Aleksandr Simma
CORR
2008
Springer
141views Education» more  CORR 2008»
14 years 10 months ago
Automatic Verification of Correspondences for Security Protocols
We present a new technique for verifying correspondences in security protocols. In particular, correspondences can be used to formalize authentication. Our technique is fully auto...
Bruno Blanchet
100
Voted
ALGORITHMICA
2006
97views more  ALGORITHMICA 2006»
14 years 10 months ago
Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and
Abstract. In this paper we prove the optimality and other properties of the -adic nonadjacent form: this expansion has been introduced in order to efficiently compute scalar multip...
Roberto Maria Avanzi, Clemens Heuberger, Helmut Pr...
TAP
2008
Springer
153views Hardware» more  TAP 2008»
14 years 10 months ago
Bounded Relational Analysis of Free Data Types
Abstract. In this paper we report on our first experiences using the relational analysis provided by the Alloy tool with the theorem prover KIV in the context of specifications of ...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif