Abstract Conjunctive Partial Deduction using Regular Types and its Application to Model Checking


Leuschel, Michael and Gruner, Stefan (2002) Abstract Conjunctive Partial Deduction using Regular Types and its Application to Model Checking. Logic Based Program Synthesis and Transformation - Selected Papers of the 11th LOPSTR Workshop, Paphos 2001, Paphos, Cyprus, Springer-Verlag, 91-110.

This is the latest version of this item.

Download

[img] PDF
Download (292Kb)

Description/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.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Additional Information: Event Dates: November 2001 Address: Berlin/Heidelberg
ISBNs: 3540439153
Keywords: Partial evaluation, abstract interpretation, partial deduction, program specialisation, regular types, verification, model checking, process algebras
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science
Item ID: 256984
Date Deposited: 05 Mar 2003
Last Modified: 16 Aug 2012 03:18
Contributors: Leuschel, Michael (Author)
Gruner, Stefan (Author)
Pettorossi, Alberto (Editor)
Date: 2002
Additional Information: Event Dates: November 2001 Address: Berlin/Heidelberg
Status: Published
Publisher: Springer-Verlag
Further Information:Google Scholar
ISI Citation Count:0
URI: http://eprints.soton.ac.uk/id/eprint/256984

Available Versions of this Item

Actions (login required)

View Item View Item