1058 search results - page 85 / 212 » It's Doomed; We Can Prove It |
JUCS
2006
14 years 9 months ago
2006
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
ECOOP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
100
click to vote
COMPSAC
2009
IEEE
14 years 11 months ago
2009
IEEE
Modular certification of low-level intermediate representation (IR) programs is one of the key steps of proof-transforming compilation. The major challenges are lexity of abstract ...
AIRS
2010
Springer
14 years 8 months ago
2010
Springer
The dominant method for evaluating search engines is the Cranfield paradigm, but the existing metrics do not consider some modern search engines features, such as document snippets...
ENTCS
2007
14 years 9 months ago
2007
Automated deduction methods should be speciļ¬ed not procedurally, but declaratively, as inference systems which are proved correct regardless of implementation details. Then, diļ...