Abstract Partial Deduction Challenged

  • Stefan Gruner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2664)


This short paper (poster) summarises my presentation [6] at this workshop [1] in September 2002. It also reflects some of the discussions at (and some new insights since) the workshop, before this summary went into print.


Logic Program Mutual Exclusion Safety Property Abstract Interpretation Program Transformation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    F. Bueno & M. Leuschel (Eds.): LOPSTR’02 PreProceedings of the International Workshop on Logic Based Program Development and Transformation (This Workshop). Technical Report, Facultad de Informática, Universidad Politécnica de Madrid (E), September 2002.Google Scholar
  2. 2.
    F. Fioravanti & A. Pettorossi & M. Proietti: Verification of Sets of Infinite State Processes using Program Transformation. Proc. of LOPSTR’2001, LNCS 2372, Springer, 2002.Google Scholar
  3. 3.
    F. Fioravanti & A. Pettorossi & M. Proietti: Combining Logic Programs and Monadic Second Order Logic by Program Transformation. This Workshop [1], pp. 166–181.Google Scholar
  4. 4.
  5. 5.
    J. Gallagher & J. Peralta: Convex Hull Abstractions in Specialisation of CLP Programs. This Workshop [1], pp. 104–114.Google Scholar
  6. 6.
    S. Gruner: Abstract Partial Deduction Challenged — Extended Abstract of Ongoing Work. This Workshop [1], pp. 251–258.Google Scholar
  7. 7.
    L. Lamport: A New Solution to Dijkstra’s Concurrent Programming Problem. Communications of the ACM 17/8, pp. 453–455, 1974.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
  9. 9.
    M. Leuschel & S. Gruner: Abstract Conjunctive Partial Deduction using Regular Types and its Application to Model Checking. Proc. of LOPSTR’2001, LNCS 2372, Springer, 2002.Google Scholar
  10. 10.
    P. Mildner: Type Domains for Abstract Interpretation — A Critical Study. Uppsala Theses in Comp. Sc. 31, ISBN 91-506-1345-6, Univ. Uppsala (S), 1999.Google Scholar
  11. 11.
    G. Snelting: Paul Feyerabend und die Softwaretechnologie. Informatik Spektrum 21/5, pp. 273–276, Springer 1998.CrossRefGoogle Scholar
  12. 12.
    G. Vidal: Curry Partial Evaluator.
  13. 13.
    E. Yardeni & E. Shapiro: A Type System for Logic Programs. Journal of Logic Programming 10/2, pp. 125–153, Elsevier, 1991.CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Stefan Gruner
    • 1
  1. 1.Declarative Systems and Software Engineering Group, Department of Electronics and Computer ScienceUniversity of Southampton

Personalised recommendations