Sciweavers

641 search results - page 88 / 129
» Formal Reliability Analysis Using Theorem Proving
Sort
View
JUCS
2008
140views more  JUCS 2008»
13 years 8 months ago
The Computable Multi-Functions on Multi-represented Sets are Closed under Programming
: In the representation approach to computable analysis (TTE) [Grz55, i00], abstract data like rational numbers, real numbers, compact sets or continuous real functions are represe...
Klaus Weihrauch
CADE
2005
Springer
14 years 9 months ago
Reflecting Proofs in First-Order Logic with Equality
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
Evelyne Contejean, Pierre Corbineau
ESOP
2005
Springer
14 years 2 months ago
Asserting Bytecode Safety
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
Martin Wildmoser, Tobias Nipkow
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
14 years 1 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
IJDE
2002
67views more  IJDE 2002»
13 years 8 months ago
Error, Uncertainty and Loss in Digital Evidence
Despite the potentially grave ramifications of relying on faulty information in the investigative or probabitive stages, the uncertainty in digital evidence is not being evaluated...
Eoghan Casey