Sciweavers

275 search results - page 52 / 55
» Non-Termination Inference of Logic Programs
Sort
View
WWW
2004
ACM
15 years 10 months ago
Semantic email
This paper investigates how the vision of the Semantic Web can be carried over to the realm of email. We introduce a general notion of semantic email, in which an email message co...
Luke McDowell, Oren Etzioni, Alon Y. Halevy, Henry...
82
Voted
ICSE
2008
IEEE-ACM
15 years 10 months ago
Symbolic mining of temporal specifications
Program specifications are important in many phases of the software development process, but they are often omitted or incomplete. An important class of specifications takes the f...
Mark Gabel, Zhendong Su
PLDI
2009
ACM
15 years 4 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
14 years 8 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
161
Voted
SIGMOD
2005
ACM
177views Database» more  SIGMOD 2005»
15 years 9 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