2218 search results - page 162 / 444 » Testing Expressibility Is Hard |
LICS
2006
IEEE
14 years 3 months ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
RTSS
2006
IEEE
14 years 3 months ago
2006
IEEE
We present a real-time, Linux-based testbed called LITMUSRT , which we have developed for empirically evaluating multiprocessor real-time scheduling algorithms. We also present th...
ACMSE
2006
ACM
14 years 3 months ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
ICTAI
2005
IEEE
14 years 2 months ago
2005
IEEE
Lotos is the ISO formal specification language for describing and verifying concurrent and distributed systems. The simulation or execution of complex Lotos specifications is, h...
XSYM
2005
Springer
14 years 2 months ago
2005
Springer
XQuery is a feature-rich language with complex semantics. This makes it hard to come up with a benchmark suite which covers all performance-critical features of the language, and a...