DPPD

The DPPD (Dozens of Problems for Partial Deduction) Library of Benchmarks. Maintained by Michael Leuschel. Suggestions, comments or new benchmark ideas, are always welcome and can be mailed to mal@ecs.soton.ac.uk. This library aims at being a standard suite of benchmarks for partial deduction. It started out by the observation that the only accepted benchmark suite in partial deduction (the so called Lam and Kusalik benchmarks) contains too few benchmarks, most of which are too simple and too small. So the idea came up to generate something like the TPTP (Thousands of Problems for Theorem Proving) library, but for partial deduction. The library contains benchmarks consisting of declarative logic programs, together with descriptions on the particular specialisation that should be performed by a partial deducer. The library also contains run-time queries by which the specialised program should be compared to the original.


References in zbMATH (referenced in 14 articles )

Showing results 1 to 14 of 14.
Sorted by year (citations)

  1. Nishida, Naoki; Vidal, Germán: A framework for computing finite SLD trees (2015)
  2. Leuschel, Michael; Vidal, Germán: Fast offline partial evaluation of logic programs (2014)
  3. Leuschel, Michael; Tamarit, Salvador; Vidal, Germán: Fast and accurate strong termination analysis with an application to partial evaluation (2010)
  4. Degrave, François; Schrijvers, Tom; Vanhoof, Wim: Automatic generation of test inputs for Mercury (2009)
  5. Leuschel, Michael; Vidal, Germán: Fast offline partial evaluation of large logic programs (2009)
  6. Leuschel, Michael; Craig, Stephen-John; Elphick, Dan: Supervising offline partial evaluation of logic programs using online techniques (2007)
  7. Pettorossi, Alberto; Proietti, Maurizio; Renault, Sophie: Derivation of efficient logic programs by specialization and reduction of nondeterminism (2005)
  8. Leuschel, Michael; Jørgensen, Jesper; Vanhoof, Wim; Bruynooghe, Maurice: Offline specialisation in Prolog using a hand-written compiler generator (2004)
  9. Alpuente, María; Echahed, Rachid; Escobar, Santiago; Lucas, Salvador: Redundancy of arguments reduced to induction. (2002)
  10. Leuschel, Michael; Bruynooghe, Maurice: Logic program specialisation through partial deduction: Control issues (2002)
  11. Leuschel, Michael; Gruner, Stefan: Abstract conjunctive partial deduction using regular types and its application to model checking (2002)
  12. De Schreye, Danny; Glück, Robert; Jørgensen, Jesper; Leuschel, Michael; Martens, Bern; Sørensen, Morten Heine: Conjunctive partial deduction: Foundations, control, algorithms, and experiments (1999)
  13. Leuschel, Michael; Jørgensen, Jesper: Efficient specialisation in Prolog using the hand-written compiler generator LOGEN (1999)
  14. Leuschel, Michael; De Schreye, Danny: Creating specialised integrity checks through partial evaluation of meta-interpreters (1998)