Sciweavers

1228 search results - page 1 / 246
» Continuations, proofs and tests
Sort
View
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 10 months ago
Continuations, proofs and tests
Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuati...
Stefano Guerrini, Andrea Masini
LICS
2005
IEEE
14 years 4 months ago
Proof Theory for Kleene Algebra
The universal Horn theory of relational Kleene algebra with tests (RKAT) is of practical interest, particularly for program semantics. We develop an (infinitary) proof system, ba...
Chris Hardin
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 11 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
CSFW
2010
IEEE
14 years 2 months ago
Towards Quantitative Analysis of Proofs of Authorization: Applications, Framework, and Techniques
—Although policy compliance testing is generally treated as a binary decision problem, the evidence gathered during the trust management process can actually be used to examine t...
Adam J. Lee, Ting Yu
CCA
2009
Springer
14 years 5 months ago
Uniqueness, Continuity, and Existence of Implicit Functions in Constructive Analysis
We extract a quantitative variant of uniqueness from the usual hypotheses of the implicit functions theorem. This leads not only to an a priori proof of continuity, but also to an ...
Hannes Diener, Peter Schuster