Sciweavers

44 search results - page 5 / 9
» Axiom Pinpointing is Hard
Sort
View
SOFSEM
2009
Springer
15 years 6 months ago
Automatic Bug Detection in Microcontroller Software by Static Program Analysis
Microcontroller software typically consists of a few hundred lines of code only, but it is rather different from standard application code. The software is highly hardware and pla...
Ansgar Fehnker, Ralf Huuck, Bastian Schlich, Micha...
DLOG
2008
15 years 6 days ago
SRIQ and SROIQ are Harder than SHOIQ
We identify the complexity of (finite model) reasoning in the DL SROIQ to be N2ExpTime-complete. We also prove that (finite model) reasoning in the DL SR--a fragment of SROIQ witho...
Yevgeny Kazakov
ISSTA
2007
ACM
14 years 11 months ago
Instrumenting where it hurts: an automatic concurrent debugging technique
As concurrent and distributive applications are becoming more common and debugging such applications is very difficult, practical tools for automatic debugging of concurrent appl...
Rachel Tzoref, Shmuel Ur, Elad Yom-Tov
SIGSOFT
2010
ACM
14 years 7 months ago
Finding latent performance bugs in systems implementations
Robust distributed systems commonly employ high-level recovery mechanisms enabling the system to recover from a wide variety of problematic environmental conditions such as node f...
Charles Edwin Killian, Karthik Nagaraj, Salman Per...
DLOG
2009
14 years 7 months ago
Model-Based Most Specific Concepts in Some Inexpressive Description Logics
Abstract. Model-based most specific concepts are a non-standard reasoning service in Description Logics. They have turned out to be useful in knowledge base completion for ontologi...
Felix Distel