Sciweavers

313 search results - page 50 / 63
» Error Correction Based on Verification Techniques
Sort
View
SIGSOFT
2002
ACM
15 years 10 months ago
Invariant inference for static checking
Static checking can verify the absence of errors in a program, but often requires written annotations or specifications. As a result, static checking can be difficult to use effec...
Jeremy W. Nimmer, Michael D. Ernst
DAC
2004
ACM
15 years 10 months ago
Abstraction of assembler programs for symbolic worst case execution time analysis
ion of Assembler Programs for Symbolic Worst Case Execution Time Analysis Tobias Schuele Tobias.Schuele@informatik.uni-kl.de Klaus Schneider Klaus.Schneider@informatik.uni-kl.de Re...
Klaus Schneider, Tobias Schüle
ERCIMDL
2007
Springer
159views Education» more  ERCIMDL 2007»
15 years 3 months ago
Reducing Costs for Digitising Early Music with Dynamic Adaptation
Abstract. Optical music recognition (OMR) enables librarians to digitise early music sources on a large scale. The cost of expert human labour to correct automatic recognition erro...
Laurent Pugin, John Ashley Burgoyne, Ichiro Fujina...
CLEF
2005
Springer
15 years 3 months ago
20th Century Esfinge (Sphinx) Solving the Riddles at CLEF 2005
Abstract. Esfinge is a general domain Portuguese question answering system. It tries to apply simple techniques to large amounts of text. Esfinge participated last year in the mono...
Luís Costa
POPL
2003
ACM
15 years 10 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula