Sciweavers

279 search results - page 53 / 56
» Determinacy Inference for Logic Programs
Sort
View
PLDI
2009
ACM
14 years 3 months ago
Snugglebug: a powerful approach to weakest preconditions
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
Satish Chandra, Stephen J. Fink, Manu Sridharan
KBSE
2010
IEEE
13 years 6 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
PPDP
2010
Springer
13 years 6 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
SIGMOD
2005
ACM
177views Database» more  SIGMOD 2005»
14 years 8 months ago
An approach for pipelining nested collections in scientific workflows
We describe an approach for pipelining nested data collections in scientific workflows. Our approach logically delimits arbitrarily nested collections of data tokens using special...
Timothy M. McPhillips, Shawn Bowers
ICLP
2005
Springer
14 years 1 months ago
An Optimised Semantic Web Query Language Implementation in Prolog
The Semantic Web is a rapidly growing research area aiming at the exchange of semantic information over the World Wide Web. The Semantic Web is built on top of RDF, an XML-based ex...
Jan Wielemaker