391 search results - page 18 / 79 » Formal Universes |
119
Voted
ACNS
2007
Springer
15 years 6 months ago
2007
Springer
In 1990, Boyar, Chaum, Damg˚ard and Pedersen introduced convertible undeniable signatures which limit the self-authenticating property of digital signatures but can be converted b...
CORR
2008
Springer
15 years 14 days ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
122
click to vote
TLCA
2007
Springer
15 years 6 months ago
2007
Springer
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
LLC
2011
14 years 7 months ago
2011
Computational phonology approaches the study of sound patterns in the world’s languages from a computational perspective. This article explains this perspective and its relevanc...
89
Voted
WOTUG
2007
15 years 1 months ago
2007
Abstract. In this paper, we present a formal model and analysis of the AMBA Advanced High-performance Bus (AHB) on-chip bus. The model is given in CSP B—an integration of the pro...