245 search results - page 18 / 49 » State Complexity of Testing Divisibility |
100
Voted
SAS
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
103
click to vote
SIGMETRICS
2010
ACM
15 years 5 months ago
2010
ACM
Perhaps surprisingly, no practical performance models exist for popular (and complex) client applications such as Adobe’s Creative Suite, Microsoft’s Office and Visual Studio...
126
click to vote
EUROSYS
2011
ACM
14 years 4 months ago
2011
ACM
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...
95
Voted
COCOON
2006
Springer
15 years 4 months ago
2006
Springer
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
112
click to vote
KBSE
2007
IEEE
15 years 6 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...