Sciweavers

4217 search results - page 30 / 844
» Computational indistinguishability logic
Sort
View
ENTCS
2007
82views more  ENTCS 2007»
14 years 9 months ago
On the Computational Representation of Classical Logical Connectives
Many programming calculi have been designed to have a Curry-Howard correspondence with a classical logic. We investigate the effect that different choices of logical connective ha...
Jayshan Raghunandan, Alexander J. Summers
ASIAN
2007
Springer
126views Algorithms» more  ASIAN 2007»
15 years 4 months ago
Computational Semantics for Basic Protocol Logic - A Stochastic Approach
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
Gergei Bana, Koji Hasebe, Mitsuhiro Okada
JDCTA
2008
74views more  JDCTA 2008»
14 years 9 months ago
Processing Logical Access Control Command in Computer System
Access control includes physical and logical access control. Physical access control protects the damage, theft and losing of assess. In this paper, we propose the method to prote...
Tsang-Yean Lee, Huey-Ming Lee, Wuu-Yee Chen, Heng-...
DAC
2005
ACM
15 years 10 months ago
Designing logic circuits for probabilistic computation in the presence of noise
As Si CMOS devices are scaled down into the nanoscale regime, current computer architecture approaches are reaching their practical limits. Future nano-architectures will confront...
Kundan Nepal, R. Iris Bahar, Joseph L. Mundy, Will...
TPHOL
1996
IEEE
15 years 1 months ago
Synthetic Domain Theory in Type Theory: Another Logic of Computable Functions
We will present a Logic of Computable Functions based on the idea of Synthetic Domain Theory such that all functions are automatically continuous. Its implementation in the Lego pr...
Bernhard Reus