Sciweavers

368 search results - page 47 / 74
» Arithmetic as a Theory Modulo
Sort
View
CIE
2008
Springer
15 years 1 months ago
A Week-End Off: The First Extensive Number-Theoretical Computation on the ENIAC
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...
Liesbeth De Mol, Maarten Bullynck
ENTCS
2010
141views more  ENTCS 2010»
14 years 12 months ago
Debugging as a Science, that too, when your Program is Changing
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...
Abhik Roychoudhury
ACS
2004
14 years 11 months ago
Components of the Fundamental Category
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 ...
Lisbeth Fajstrup, Martin Raußen, Eric Goubau...
LICS
2010
IEEE
14 years 9 months ago
Regular Cost Functions over Finite Trees
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...
Thomas Colcombet, Christof Löding
PTS
2010
175views Hardware» more  PTS 2010»
14 years 9 months ago
Test Data Generation for Programs with Quantified First-Order Logic Specifications
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...
Christoph Gladisch