378 search results - page 23 / 76 » Proof interpretations with truth |
CC
2009
Springer
14 years 9 months ago
2009
Springer
This paper presents a compiler which produces machine code from functions defined in the logic of a theorem prover, and at the same time proves that the generated code executes the...
LPAR
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience ...
ASIACRYPT
2000
Springer
14 years 1 months ago
2000
Springer
A discrete-logarithm algorithm is called generic if it does not exploit the specific representation of the cyclic group for which it is supposed to compute discrete logarithms. Su...
POPL
2001
ACM
14 years 9 months ago
2001
ACM
We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higher-order logic program, the proof checker is replaced by a nondeter...
OTM
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. The term ‘Master Data’ brings up different interpretations and connotations, especially with vendors espousing the “single version of the truth”. Is there a singl...