Results 1  10
of
563,052
ProofCarrying Code
, 1997
"... This paper describes proofcarrying code (PCC), a mechanism by which a host system can determine with certainty that it is safe to execute a program supplied (possibly in binary form) by an untrusted source. For this to be possible, the untrusted code producer must supply with the code a safety proo ..."
Abstract

Cited by 1263 (27 self)
 Add to MetaCart
This paper describes proofcarrying code (PCC), a mechanism by which a host system can determine with certainty that it is safe to execute a program supplied (possibly in binary form) by an untrusted source. For this to be possible, the untrusted code producer must supply with the code a safety
Mechanizing Proofs of Computation Equivalence
, 1999
"... A prooftheoretic mechanized verification environment that allows taking advantage of the "convenient computations" method is presented. The PV S theories encapsulating this method reduce the conceptual difficulty of proving a property for all the possible interleavings of a parallel compu ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A prooftheoretic mechanized verification environment that allows taking advantage of the "convenient computations" method is presented. The PV S theories encapsulating this method reduce the conceptual difficulty of proving a property for all the possible interleavings of a parallel
Mechanical Proofs of Security Properties
 IN EUROPEAN SYMPOSIUM ON RESEARCH IN COMPUTER SECURITY
, 1994
"... We give a formal definition of the notion of information flow for a simple guarded command language. We propose an axiomatisation of security properties based on this notion of information flow and we prove its soundness with respect to the operational semantics of the language. We then identify the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
the sources of non determinism in proofs and we derive in successive steps an inference algorithm which is both sound and complete with respect to the inference system. The complexity of the resulting algorithm is linear in terms of the size of the program and the analysis can realistically be integrated
Mechanizing Proof for the Z Toolkit
"... This paper reports on theorems and proof procedures for working with the Z mathematical toolkit developed using the ProofPower system. This development has taken place in parallel with work on ProofPower itself over the last 10 years. Since the underlying mathematics is not completely trivial and i ..."
Abstract
 Add to MetaCart
This paper reports on theorems and proof procedures for working with the Z mathematical toolkit developed using the ProofPower system. This development has taken place in parallel with work on ProofPower itself over the last 10 years. Since the underlying mathematics is not completely trivial
Mechanical Proofs about Computer Programs
, 1984
"... The Gypsy verification environment is a large computer program that supports the development of software systems and formal, mathematical proofs about their behavior. The environment provides conventional development tools, such as a parser for the Gypsy language, an editor and a compiler. These are ..."
Abstract

Cited by 31 (0 self)
 Add to MetaCart
to prove that the component always runs according to specification. Facilities for constructing formal, mechanical proofs of these formulas also are provided. Many of these proofs are completed automatically without human intervention. The capabilities of the Gypsy system and the results of its
StrategyProofness and Arrow’s Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions
 J. Econ. Theory
, 1975
"... Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategyproof if it always induces every committee member to cast a ballot revealing his preference. I pro ..."
Abstract

Cited by 542 (0 self)
 Add to MetaCart
Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategyproof if it always induces every committee member to cast a ballot revealing his preference. I
Statistical mechanics of complex networks
 Rev. Mod. Phys
"... Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as ra ..."
Abstract

Cited by 2083 (10 self)
 Add to MetaCart
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as random graphs, it is increasingly recognized that the topology and evolution of real
Hierarchical correctness proofs for distributed algorithms
, 1987
"... Abstract: We introduce the inputoutput automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular, hierarchical correctness proofs for distributed algorithms. We de ne this model, and give aninteresting example of how ..."
Abstract

Cited by 439 (66 self)
 Add to MetaCart
Abstract: We introduce the inputoutput automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular, hierarchical correctness proofs for distributed algorithms. We de ne this model, and give aninteresting example
Mechanical proofs of the Levi commutator problem
 Notes of the CADE15 Workshop on Problem Solving Methodologies with Automated Deduction
, 1998
"... . This note presents purely mechanical proofs of the Levi commutator problem in group theory. The problem was solved first by using the theorem prover EQP, developed by William McCune at the Argonne National Laboratory. The fastest proof was found by using Peersmcd, the ClauseDiffusion paralleliza ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
. This note presents purely mechanical proofs of the Levi commutator problem in group theory. The problem was solved first by using the theorem prover EQP, developed by William McCune at the Argonne National Laboratory. The fastest proof was found by using Peersmcd, the Clause
A Fast Quantum Mechanical Algorithm for Database Search
 ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1996
"... Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a supe ..."
Abstract

Cited by 1126 (10 self)
 Add to MetaCart
Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a
Results 1  10
of
563,052