Sciweavers

43 search results - page 2 / 9
» Arithmetic completely regular codes
Sort
View
MLQ
2008
63views more  MLQ 2008»
13 years 4 months ago
Generic cuts in models of arithmetic
We present some general results concerning the topological space of cuts of a countable model of arithmetic given by a particular indicator Y . The notion of `indicator' is d...
Richard Kaye
PPOPP
2005
ACM
13 years 10 months ago
Fault tolerant high performance computing by a coding approach
As the number of processors in today’s high performance computers continues to grow, the mean-time-to-failure of these computers are becoming significantly shorter than the exe...
Zizhong Chen, Graham E. Fagg, Edgar Gabriel, Julie...
RTA
2005
Springer
13 years 10 months ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner
PLDI
2009
ACM
14 years 5 months ago
SoftBound: highly compatible and complete spatial memory safety for c
The serious bugs and security vulnerabilities facilitated by C/C++'s lack of bounds checking are well known, yet C and C++ remain in widespread use. Unfortunately, C's a...
Santosh Nagarakatte, Jianzhou Zhao, Milo M. K. Mar...
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 4 months ago
Executable Set Theory and Arithmetic Encodings in Prolog
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic...
Paul Tarau