Sciweavers

39 search results - page 5 / 8
» Tutorial on Specialisation of Logic Programs
Sort
View
JUCS
2006
104views more  JUCS 2006»
13 years 7 months ago
Introducing the ITP Tool: a Tutorial
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
Manuel Clavel, Miguel Palomino, Adrián Ries...
WLP
1997
Springer
13 years 11 months ago
Constrained Partial Deduction
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
Michael Leuschel, Danny De Schreye
WSC
2007
13 years 9 months ago
The optimizing-simulator: merging simulation and optimization using approximate dynamic programming
There has long been a competition between simulation and optimization in the modeling of problems in transportation and logistics, machine scheduling and similar highdimensional p...
Warren B. Powell
DAGSTUHL
1996
13 years 8 months ago
Efficiently Generating Efficient Generating Extensions in Prolog
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evalua...
Jesper Jørgensen, Michael Leuschel
FMCO
2005
Springer
153views Formal Methods» more  FMCO 2005»
14 years 1 months ago
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
Abstract. Separation logic is a program logic for reasoning about programs that manipulate pointer data structures. We describe Smallfoot, a tool for checking certain lightweight s...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn