Sciweavers

2040 search results - page 62 / 408
» On the Complexity of Error Explanation
Sort
View
SIGSOFT
2003
ACM
16 years 18 days ago
ARCHER: using symbolic, path-sensitive analysis to detect memory access errors
Memory corruption errors lead to non-deterministic, elusive crashes. This paper describes ARCHER (ARray CHeckER) a static, effective memory access checker. ARCHER uses path-sensit...
Yichen Xie, Andy Chou, Dawson R. Engler
APVIS
2011
13 years 12 months ago
Edge maps: Representing flow with bounded error
Robust analysis of vector fields has been established as an important tool for deriving insights from the complex systems these fields model. Many analysis techniques rely on co...
Harsh Bhatia, Shreeraj Jadhav, Peer-Timo Bremer, G...
WWW
2005
ACM
16 years 16 days ago
Debugging OWL ontologies
As an increasingly large number of OWL ontologies become available on the Semantic Web and the descriptions in the ontologies become more complicated, finding the cause of errors ...
Bijan Parsia, Evren Sirin, Aditya Kalyanpur
AAAI
2008
15 years 2 months ago
A Meta-Programming Technique for Debugging Answer-Set Programs
Answer-set programming (ASP) is widely recognised as a viable tool for declarative problem solving. However, there is currently a lack of tools for developing answer-set programs....
Martin Gebser, Jörg Pührer, Torsten Scha...
AAAI
2007
15 years 2 months ago
Detecting Execution Failures Using Learned Action Models
reason with abstracted models of the behaviours they use to construct plans. When plans are turned into the instructions that drive an executive, the real behaviours interacting w...
Maria Fox, Jonathan Gough, Derek Long