2218 search results - page 63 / 444 » Testing Expressibility Is Hard |
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
SIGSOFT
2006
ACM
14 years 8 months ago
2006
ACM
Recent software systems usually feature an automated failure reporting system, with which a huge number of failing traces are collected every day. In order to prioritize fault dia...
WSDM
2010
ACM
14 years 5 months ago
2010
ACM
Activity in social media such as blogs, micro-blogs, social networks, etc is manifested via interaction that involves text, images, links and other information items. Naturally, s...
OOPSLA
2007
Springer
14 years 1 months ago
2007
Springer
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Previous and related work has shown that runtime m...
ESWS
2008
Springer
13 years 9 months ago
2008
Springer
: The mathematical nature of description logics has meant that domain experts find them hard to understand. This forms a significant impediment to the creation and adoption of onto...