368 search results - page 47 / 74 » Arithmetic as a Theory Modulo |
92
Voted
CIE
2008
Springer
15 years 5 months ago
2008
Springer
The first extensive number-theoretical computation run on the world's first U.S. digital general-purpose electronic computer, the ENIAC, is reconstructed. The problem, computi...
152
click to vote
ENTCS
2010
15 years 3 months ago
2010
Program debugging is an extremely time-consuming process, and it takes up a large portion of software development time. In practice, debugging is still very much of an art, with t...
126
Voted
ACS
2004
15 years 3 months ago
2004
Inthis article westudy the fundamental category (Goubault and Raussen, 2002 Goubault, 2002) of a partially ordered topological space (Nachbin, 1965 Johnstone, 1982), as arising in ...
138
Voted
LICS
2010
IEEE
15 years 1 months ago
2010
IEEE
We develop the theory of regular cost functions over finite trees: a quantitative extension to the notion of regular languages of trees: Cost functions map each input (tree) to a v...
190
Voted
PTS
2010
15 years 1 months ago
2010
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...