2000

  • Andrew Currie, Michael Leuschel, Thierry Massart
    LTL Model Checking of CSP by Refinement: How to Make FDR Spin.
    In Proceedings VCL'2000, 2000.
    • Helko Lehmann, Michael Leuschel
      Decidability Results for the Propositional Fluent Calculus.
      In Computational Logic, John LLoyd, Lecture Notes in Computer Science, 1861, Springer-Verlag, 762--776, 2000.
      • Helko Lehmann, Michael Leuschel
        Solving Planning Problems by Partial Deduction.
        In LPAR, Michel Parigot and Andrei Voronkov, Lecture Notes in Computer Science, 1955, Springer-Verlag, 2000.
      • Michael Leuschel, Maurice Bruynooghe
        Control Issues in Partial Deduction: The Ever Ending Story.
        Technical Report, University of Southampton, 2000.
        • Michael Leuschel, Helko Lehmann
          Coverability of Reset Petri Nets and other Well-Structured Transition Systems by Partial Deduction.
          In Computational Logic, John Lloyd and Verónica Dahl and Ulrich Furbach and Manfred Kerber and Kung-Kiu Lau and Catuscia Palamidessi and Luı́s Moniz Pereira and Yehoshua Sagiv and Peter J. Stuckey, Lecture Notes in Computer Science, 1861, Springer-Verlag, 101--115, 2000.
        • Michael Leuschel, Helko Lehmann
          Solving Coverability Problems of Petri Nets by Partial Deduction.
          In PPDP, Maurizio Gabbrielli and Frank Pfenning, ACM Press, 268--279, 2000.
        • Proceedings of the Workshop on Verification and Computational Logic VCL'2000.
          In Michael Leuschel and Andreas Podelski and C.R. Ramakrishnan and Ulrich Ultes-Nitsche, 2000.