Sciweavers

393 search results - page 53 / 79
» Logic Programs with Classical Negation
Sort
View
PPDP
2007
Springer
14 years 2 months ago
Unfolding in CHR
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it con...
Paolo Tacchella, Maurizio Gabbrielli, Maria Chiara...
TPHOL
2009
IEEE
14 years 3 months ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk
SIGIR
1998
ACM
14 years 22 days ago
DOLORES: A System for Logic-Based Retrieval of Multimedia Objects
We describe the design and implementation of a system for logic-based multimedia retrieval. As highlevel logic for retrieval of hypermedia documents, we have developed a probabilis...
Norbert Fuhr, Norbert Gövert, Thomas Röl...
SAC
2010
ACM
13 years 6 months ago
A machine-checked soundness proof for an efficient verification condition generator
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
Frédéric Vogels, Bart Jacobs 0002, F...
ESOP
2005
Springer
14 years 2 months ago
Forward Slicing by Conjunctive Partial Deduction and Argument Filtering
Program slicing is a well-known methodology that aims at identifying the program statements that (potentially) affect the values computed at some point of interest. Within imperat...
Michael Leuschel, Germán Vidal