Sciweavers

3228 search results - page 17 / 646
» Computationally Sound Proofs
Sort
View
TPHOL
2000
IEEE
13 years 12 months ago
Proving ML Type Soundness Within Coq
We verify within the Coq proof assistant that ML typing is sound with respect to the dynamic semantics. We prove this property in the framework of a big step semantics and also in ...
Catherine Dubois
TABLEAUX
1995
Springer
13 years 11 months ago
On Transforming Intuitionistic Matrix Proofs into Standard-Sequent Proofs
We present a procedure transforming intuitionistic matrix proofs into proofs within the intuitionistic standard sequent calculus. The transformation is based on L. Wallen’s proof...
Stephan Schmitt, Christoph Kreitz
ECCV
2008
Springer
13 years 9 months ago
Shape-Based Retrieval of Heart Sounds for Disease Similarity Detection
Retrieval of similar heart sounds from a sound database has applications in physician training, diagnostic screening, and decision support. In this paper, we exploit a visual rende...
Tanveer Fathima Syeda-Mahmood, Fei Wang
FOCS
2009
IEEE
14 years 2 months ago
A Parallel Repetition Theorem for Any Interactive Argument
— The question of whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an ex...
Iftach Haitner
FMCO
2004
Springer
157views Formal Methods» more  FMCO 2004»
14 years 26 days ago
MoMo: A Modal Logic for Reasoning About Mobility
Abstract. A temporal logic is proposed as a tool for specifying properties of Klaim programs. Klaim is an experimental programming language that supports a programming paradigm whe...
Rocco De Nicola, Michele Loreti