Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
12
Towards Verifying Declarative . . .
, 2010
"... Declarative languages, such as recursive rule based languages, have been proposed to program distributed applications over networks. It has been shown that they simplify greatly the code, while still offering efficient distributed execution. In this paper, we show that moreover they provide a promi ..."
Abstract
- Add to MetaCart
of the protocols can be simply encoded in Coq. Finally, we develop the machine embedded on each node of the network which evaluates the rules. This framework enables us to formally verify distributed declarative protocols, as sketched on a concrete example, a breadth-first search tree construction in a distributed
Creative Commons Attribution License. Formalization of Quantum Protocols using Coq
"... Quantum Information Processing, which is an exciting area of research at the intersection of physics and computer science, has great potential for influencing the future development of information pro-cessing systems. The building of practical, general purpose Quantum Computers may be some years int ..."
Abstract
- Add to MetaCart
-theoretic proofs, which may or may not reflect actual system behaviour. Moreover, testing of implementations cannot guarantee the absence of bugs and errors. This paper presents a novel framework for modelling and verifying quantum protocols and their implementations using the proof assistant Coq. We provide a Coq
On the Development and Formalization of an Extensible Code Generator for Real Life Security Protocols
"... This paper introduces Expi2Java, a new code generator for cryptographic protocols that translates models written in an extensible variant of the Spi calculus into executable code in a substantial fragment of Java, featuring concurrency, synchronization between threads, exception handling and a sophi ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
of TLS v1.0 client and server from a protocol model verified with ProVerif. Furthermore, we have formalized the translation algorithm of Expi2Java using the Coq proof assistant, and proved that the generated programs are well-typed if the original models are well-typed. This constitutes an important step
Theorem Proving in Higher Order Logics
, 2003
"... Algebra in Type Theory with Dependent Records . . . 13 Xin Yu, Aleksey Nogin, Alexei Kopylov and Jason Hickey Implementing and Automating Basic Number Theory in MetaPRL Proof Assistant . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111 Frederic Gava and Frederic Loulerge The Semantics of C++ Data Types: Towards Verifying low-level System Components . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127 Michael Hohmuth and Hendrik Tews Modeling and Verification
The Contest Between Simplicity and Efficiency in Asynchronous Byzantine Agreement
"... In the wake of the decisive impossibility result of Fischer, Lynch, and Paterson for deterministic consensus protocols in the aynchronous model with just one failure, Ben-Or and Bracha demonstrated that the problem could be solved with randomness, even for Byzantine failures. Both protocols are natu ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
In the wake of the decisive impossibility result of Fischer, Lynch, and Paterson for deterministic consensus protocols in the aynchronous model with just one failure, Ben-Or and Bracha demonstrated that the problem could be solved with randomness, even for Byzantine failures. Both protocols
By
, 2013
"... I declare that this thesis is my own account of my research and contains as its main content work which has not previously been submitted for a degree at any tertiary education institution. ..."
Abstract
- Add to MetaCart
I declare that this thesis is my own account of my research and contains as its main content work which has not previously been submitted for a degree at any tertiary education institution.
Secure Geographic Routing in Wireless Sensor Networks
, 2013
"... the non-exclusive right to publish the Work electronically and in a non-commercial purpose make it accessible on the Internet. The Author warrants that he/she is the author to the Work, and warrants that the Work does not contain text, pictures or other material that violates copyright law. The Auth ..."
Abstract
- Add to MetaCart
the non-exclusive right to publish the Work electronically and in a non-commercial purpose make it accessible on the Internet. The Author warrants that he/she is the author to the Work, and warrants that the Work does not contain text, pictures or other material that violates copyright law
c Copyright by
"... Messaging is a basic service in sensornets. Yet the unique system and application prop-erties of sensornets pose substantial challenges for the messaging design: Firstly, dynamic wireless links, constrained resources, and application diversity challenge the architecture and protocol design of sensor ..."
Abstract
- Add to MetaCart
Messaging is a basic service in sensornets. Yet the unique system and application prop-erties of sensornets pose substantial challenges for the messaging design: Firstly, dynamic wireless links, constrained resources, and application diversity challenge the architecture and protocol design
Title of Document: QUANTUM MECHANICS AND QUANTUM INFORMATION THEORY
"... The principle aim of this dissertation is to investigate the philosophical application of quantum information theory to interpretational issues regarding the theory of quantum mechanics. Recently, quantum information theory has emerged as a potential source for such an interpretation. The main quest ..."
Abstract
- Add to MetaCart
The principle aim of this dissertation is to investigate the philosophical application of quantum information theory to interpretational issues regarding the theory of quantum mechanics. Recently, quantum information theory has emerged as a potential source for such an interpretation. The main
unknown title
"... Abstract We provide a treatise about checking proofs of distributed systems by computer using general purpose proof checkers. In particular, we present two approaches to verifying and checking the verification of the Sequential Line Interface Protocol (SLIP), one using rewriting techniques and one ..."
Abstract
- Add to MetaCart
, llJ were proved with Coq. Examples of protocols or distributed systems have also been verified in a combination of theorem proving and model checking. An 8.2m-bit multiplier was verified with LP for arbitrary values of m in A THE SET OF REWRITE RULES (APPENDIX TO SECTION 4) 20 A The set of rewrite
Results 1 - 10
of
12
