861 search results - page 56 / 173 » Symbolic Program Analysis Using Term Rewriting and Generaliz... |
127
click to vote
ICS
2005
Tsinghua U.
15 years 8 months ago
2005
Tsinghua U.
Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to eve...
107
click to vote
ISSTA
2009
ACM
15 years 9 months ago
2009
ACM
Techniques for test-case prioritization re-order test cases to increase their rate of fault detection. When there is a fixed time budget that does not allow the execution of all ...
160
click to vote
HASKELL
2009
ACM
15 years 9 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
114
click to vote
LDTA
2010
15 years 3 months ago
2010
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
134
click to vote
KBSE
2007
IEEE
15 years 9 months ago
2007
IEEE
Achieving high structural coverage such as branch coverage in objectoriented programs is an important and yet challenging goal due to two main challenges. First, some branches inv...