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

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.

Authors

• Michael Leuschel
• Stefan Gruner

Keywords

No keywords are indexed for this paper.