Sciweavers

7988 search results - page 997 / 1598
» A Useful Undecidable Theory
Sort
View
CSFW
2010
IEEE
15 years 11 months ago
A Machine-Checked Formalization of Sigma-Protocols
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
Gilles Barthe, Daniel Hedin, Santiago Zanella B&ea...
ITP
2010
140views Mathematics» more  ITP 2010»
15 years 11 months ago
Case-Analysis for Rippling and Inductive Proof
Abstract. Rippling is a heuristic used to guide rewriting and is typically used for inductive theorem proving. We introduce a method to support case-analysis within rippling. Like ...
Moa Johansson, Lucas Dixon, Alan Bundy
ECAI
2006
Springer
15 years 11 months ago
A Learning Classifier Approach to Tomography
Tomography is an important technique for noninvasive imaging: images of the interior of an object are computed from several scanned projections of the object, covering a range of a...
Kees Joost Batenburg
ESOP
2000
Springer
15 years 11 months ago
Type Classes with Functional Dependencies
Abstract. Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For ...
Mark P. Jones
ICSE
1997
IEEE-ACM
15 years 11 months ago
Introducing Formal Specification Methods in Industrial Practice
Formal specification methods are not often applied in industrial projects, despite their advantages and the maturity of theories and tools. The scarce familiarity of practitioners...
Luciano Baresi, Alessandro Orso, Mauro Pezzè...