Sciweavers

388 search results - page 63 / 78
» Scalable Web Reasoning Using Logic Programming Techniques
Sort
View
LPAR
2012
Springer
12 years 3 months ago
E-Matching with Free Variables
E-matching is the most commonly used technique to handle quantifiers in SMT solvers. It works by identifying characteristic subexpressions of quantified formulae, named triggers,...
Philipp Rümmer
SEMWEB
2004
Springer
14 years 1 months ago
Learning Meta-descriptions of the FOAF Network
We argue that in a distributed context, such as the Semantic Web, ontology engineers and data creators often cannot control (or even imagine) the possible uses their data or ontolo...
Gunnar Aastrand Grimnes, Peter Edwards, Alun D. Pr...
SIGSOFT
2008
ACM
14 years 8 months ago
Finding programming errors earlier by evaluating runtime monitors ahead-of-time
Runtime monitoring allows programmers to validate, for instance, the proper use of application interfaces. Given a property specification, a runtime monitor tracks appropriate run...
Eric Bodden, Patrick Lam, Laurie J. Hendren
PLDI
2005
ACM
14 years 1 months ago
DART: directed automated random testing
We present a new tool, named DART, for automatically testing software that combines three main techniques: (1) automated extraction of the interface of a program with its external...
Patrice Godefroid, Nils Klarlund, Koushik Sen
EMSOFT
2006
Springer
13 years 11 months ago
Software partitioning for effective automated unit testing
A key problem for effective unit testing is the difficulty of partitioning large software systems into appropriate units that can be tested in isolation. We present an approach th...
Arindam Chakrabarti, Patrice Godefroid