3228 search results - page 437 / 646 » Computationally Sound Proofs |
134
Voted
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
The RAIN (Reliable Array of Independent Nodes) project at Caltech is focusing on creating highly reliable distributed systems by leveraging commercially available personal compute...
116
Voted
IJBC
2007
15 years 3 months ago
2007
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...
109
Voted
DAC
1998
ACM
16 years 4 months ago
1998
ACM
Increasingly popular reuse-based design paradigms create a pressing need for authorship enforcement techniques that protect the intellectual property rights of designers. We devel...
112
Voted
DAC
1999
ACM
16 years 4 months ago
1999
ACM
Abstract { This paper presents the machine description language LISA for the generation of bitand cycle accurate models of DSP processors. Based on a behavioral operation descripti...
136
Voted
CADE
2007
Springer
16 years 3 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...