837 search results - page 46 / 168 » Proof Development with OMEGA |
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...
STOC
1999
ACM
14 years 2 months ago
1999
ACM
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
POPL
2009
ACM
14 years 4 months ago
2009
ACM
We develop a rigorous semantics for Power and ARM multiprocessor programs, including their relaxed memory model and the behaviour of reasonable fragments of their instruction sets...
MICAI
2004
Springer
14 years 3 months ago
2004
Springer
We address the problem of integrating standard techniques for automatic invariant generation within the context of program reasoning. We propose the use of invariant patterns whic...
CIE
2010
Springer
14 years 2 months ago
2010
Springer
We develop applications of selection functions to proof theory and computational extraction of witnesses from proofs in classical analysis. The main novelty is a translation of cla...