Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking

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

Abstract

We present an abstract partial deduction technique which uses regular types as its domain and which can handle conjunctions, and thus perform deforestation and tupling. We provide a detailed description of all the required operations and present an implementation within the ecce system. We discuss the power of this new specialisation algorithm, especially in the light of verifying and specialising infinite state process algebras. Here, our new algorithm can provide a more precise treatment of synchronisation and can be used for refinement checking.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Michael Leuschel
    • 1
  • Stefan Gruner
    • 1
  1. 1.Department of Electronics and Computer ScienceUniversity of SouthamptonHighfield, SouthamptonUK

Personalised recommendations