4940 search results - page 600 / 988 » On the Complexity of Universal Programs |
214
click to vote
FMAM
2010
15 years 4 months ago
2010
: Members of the agile programming and formal methods communities do not always see eye-to-eye. These two communities often do not talk to or learn from each other. Only recently, ...
199
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
171
click to vote
COGSR
2011
15 years 1 months ago
2011
We present an application of the analytical inductive programming system Igor to learning sets of recursive rules from positive experience. We propose that this approach can be us...
191
click to vote
IJKSR
2011
14 years 10 months ago
2011
Learning management systems are routinely used for presenting, solving and grading exercises with large classes. However, teachers are constrained to use questions with pre-defined...
193
click to vote
PLDI
2011
ACM
14 years 9 months ago
2011
ACM
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...