Sciweavers

1710 search results - page 53 / 342
» High-Level Programs and Program Conditions
Sort
View
PPDP
1999
Springer
14 years 7 days ago
Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices
We present a slicing approach for analyzing logic programs with respect to non-termination. The notion of a failure-slice is presented which is an executable reduced fragment of th...
Ulrich Neumerkel, Frédéric Mesnard
TSE
2011
145views more  TSE 2011»
13 years 2 months ago
Semi-Proving: An Integrated Method for Program Proving, Testing, and Debugging
— We present an integrated method for program proving, testing, and debugging. Using the concept of metamorphic relations, we select necessary properties for target programs. For...
Tsong Yueh Chen, T. H. Tse, Zhiquan Zhou
PPDP
2010
Springer
13 years 6 months ago
Graph queries through datalog optimizations
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. L...
RR
2010
Springer
13 years 6 months ago
A Rule-Based Approach to XML Processing and Web Reasoning
Abstract. We illustrate the potential of conditional hedge transformations in Web-related applications on the example of PρLog: an extension of logic programming with advanced rul...
Jorge Coelho, Besik Dundua, Mário Florido, ...
FAC
2006
79views more  FAC 2006»
13 years 8 months ago
A formal relationship between program slicing and partial evaluation
A formal relationship between program slicing and partial evaluation is established. It is proved that for terminating programs, a residual program produced by partial evaluation i...
David Binkley, Sebastian Danicic, Mark Harman, Joh...