Results 1  10
of
65
Automated Security Proofs with Sequences of Games
 Proc. 27th IEEE Symposium on Security
, 2006
"... Abstract. This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic protocols were up to now reserved to the DolevYao model, which however makes quite strong assumptions on the pr ..."
Abstract

Cited by 48 (9 self)
 Add to MetaCart
Abstract. This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic protocols were up to now reserved to the DolevYao model, which however makes quite strong assumptions
Journal of Automated Reasoning manuscript No. (will be inserted by the editor) The Right Tools for the Job: Correctness of Cone of Influence Reduction Proved Using
"... Abstract We present a case study illustrating how to exploit the expressive power of higherorder logic to complete a proof whose main lemma is already proved in a firstorder theorem prover. Our proof exploits a link between the HOL4 and ACL2 proof systems to show correctness of a cone of influence ..."
Abstract
 Add to MetaCart
Abstract We present a case study illustrating how to exploit the expressive power of higherorder logic to complete a proof whose main lemma is already proved in a firstorder theorem prover. Our proof exploits a link between the HOL4 and ACL2 proof systems to show correctness of a cone of influence
Automatic Noninterference Lemmas for Parameterized Model Checking
, 2008
"... Parameterized model checking refers to any method that extends traditional, finitestate model checking to handle systems with an arbitrary number of processes. One popular approach to this problem uses abstraction and socalled guard strengthening. Here a small number of processes remain intact, w ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
the strongest noninterference lemma provable in the Galois connection. Hence, if the approach fails to prove the property, then no human lemma would help, since it is the strongest possible lemma. We instantiate this theory to a class of symmetric parameterized systems, and show how BDDs can be used to perform
Combining ACL2 and an Automated Verification Tool to Verify a Multiplier
 Proceedings of the Sixth International Workshop on the ACL2 Theorem Prover and Its Applications (ACL2 2006
, 2006
"... We have extended the ACL2 theorem prover to automatically prove properties of VHDL circuits with IBM’s Internal SixthSense verification system. We have used this extension to verify a multiplier used in an industrial floating point unit. The property we ultimately verify corresponds to the correctne ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We have extended the ACL2 theorem prover to automatically prove properties of VHDL circuits with IBM’s Internal SixthSense verification system. We have used this extension to verify a multiplier used in an industrial floating point unit. The property we ultimately verify corresponds
MaLARea: a Metasystem for Automated Reasoning in Large Theories
"... MaLARea (a Machine Learner for Automated Reasoning) is a simple metasystem iteratively combining deductive Automated Reasoning tools (now the E and the SPASS ATP systems) with a machine learning component (now the SNoW system used in the naive Bayesian learning mode). Its intended use is in large th ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
MaLARea (a Machine Learner for Automated Reasoning) is a simple metasystem iteratively combining deductive Automated Reasoning tools (now the E and the SPASS ATP systems) with a machine learning component (now the SNoW system used in the naive Bayesian learning mode). Its intended use is in large
Proceedings of the Federated Conference on Computer Science and Information Systems pp. 849–854 ISBN 9788360810224 Automated Conversion of ST Control Programs to Why for Verification Purposes
"... Abstract—The paper presents a prototype tool ST2Why, which converts a Behavioral Interface Specification Language for ST language from IEC 611313 standard to Why code. The specification annotations are stored as special comments, which are close to implementation and readable by the programmer. Fur ..."
Abstract
 Add to MetaCart
. Further transformation with Why tool into verification lemmas, confirms compliance between specification and implementation. Proving lemmas is performed in Coq, but other provers can be used as well. I.
MATHsAiD: a mathematical theorem discovery tool
 In SYNASC’06
, 2006
"... Abstract In the eld of automated reasoning, one of the most challenging (even if, perhaps, somewhat overlooked) problems thus far has been to develop a means of discerning, from amongst all the truths that can be discovered and proved, those which are either useful or interesting enough to be worth ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
Abstract In the eld of automated reasoning, one of the most challenging (even if, perhaps, somewhat overlooked) problems thus far has been to develop a means of discerning, from amongst all the truths that can be discovered and proved, those which are either useful or interesting enough
Lemmatization for Stronger Reasoning in Large Theories
"... Abstract. In this work we improve ATP performance in large theories by the reuse of lemmas derived in previous related problems. Given a large set of related problems to solve, we run automated theorem provers on them, extract a large number of lemmas from the proofs found and postprocess the lemma ..."
Abstract
 Add to MetaCart
process the lemmas to make them usable in the remaining problems. Then we filter the lemmas by several tools and extract their proof dependencies, and use machine learning on such proof dependencies to add the most promising generated lemmas to the remaining problems. On such enriched problems we run the automated
Indistinguishability amplification
, 2006
"... A random system is the abstraction of the inputoutput behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and proofs can be seen as the proof that a certain random system (e.g. a block cipher) is indistinguishable from an ide ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
operation of systems (including the combination of functions or the cascade of permutations), we prove two amplification theorems. The first is a directproduct theorem, similar in spirit to the XORLemma: The distinguishing advantage (or security) of the combination of two (possibly stateful) systems
DOI 10.1007/s113340100127y ORIGINAL PAPER Deductive verification of cryptographic software
"... Abstract We apply stateofthe art deductive verification tools to check securityrelevant properties of cryptographic software, including safety, absence of error propagation, and correctness with respect to reference implementations. We also develop techniques to help us in our task, focusing on m ..."
Abstract
 Add to MetaCart
on methods oriented towards increased levels of automation, in scenarios where there are clear obvious limits to such automation. These techniques allow us to integrate automatic proof tools with an interactive proof assistant, where the latter is used offline to prove onceandforall fundamental lemmas
Results 1  10
of
65