Sciweavers

756 search results - page 132 / 152
» Using Logic Programs to Reason about Infinite Sets
Sort
View
POPL
2004
ACM
14 years 8 months ago
Free theorems in the presence of seq
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Janis Voigtländer, Patricia Johann
OOPSLA
2010
Springer
13 years 6 months ago
Efficient modular glass box software model checking
Glass box software model checking incorporates novel techniques to identify similarities in the state space of a model checker and safely prune large numbers of redundant states w...
Michael Roberson, Chandrasekhar Boyapati
ICLP
2007
Springer
14 years 2 months ago
DLVHEX-SPARQL: A SPARQL Compliant Query Engine Based on DLVHEX
This paper describes the dlvhex SPARQL plugin, a query processor for the upcoming Semantic Web query language standard by W3C. We report on the implementation of this languages usi...
Axel Polleres, Roman Schindlauer
KES
2005
Springer
14 years 1 months ago
Ontology Modeling and Storage System for Robot Context Understanding
Abstract. A mobile robot that interacts with its environment needs a machineunderstandable representation of objects and their usages. We present an ontology of objects, with gener...
Eric Wang, Yong Se Kim, Hak Soo Kim, Jin Hyun Son,...
FTCS
1998
144views more  FTCS 1998»
13 years 9 months ago
Improving Software Robustness with Dependability Cases
Programs fail mainly for two reasons: logic errors in the code, and exception failures. Exception failures can account for up to 2/3 of system crashes [6], hence are worthy of ser...
Roy A. Maxion, Robert T. Olszewski