The University of Southampton
University of Southampton Institutional Repository

Abstract conjunctive partial deduction using regular types and Its application to model checking

Abstract conjunctive partial deduction using regular types and Its application to model checking
Abstract conjunctive partial deduction using regular types and Its application to model checking
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.
0302-9743
91-110
Springer
Leuschel, Michael
c2c18572-66cf-4f84-ade4-218ce3afe78b
Gruner, Stefan
d223b727-7b0e-4187-b34c-21bba691742d
Pettorossi, A.
Leuschel, Michael
c2c18572-66cf-4f84-ade4-218ce3afe78b
Gruner, Stefan
d223b727-7b0e-4187-b34c-21bba691742d
Pettorossi, A.

Leuschel, Michael and Gruner, Stefan (2002) Abstract conjunctive partial deduction using regular types and Its application to model checking. In, Pettorossi, A. (ed.) Logic Based Program Synthesis and Transformation. LOPSTR 2001. (Logic Based Program Synthesis and Transformation, 2372) Berlin; Heidelberg. Springer, pp. 91-110. (doi:10.1007/3-540-45607-4_6).

Record type: Book Section

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.

This record has no associated files available for download.

More information

Published date: 4 July 2002

Identifiers

Local EPrints ID: 422071
URI: http://eprints.soton.ac.uk/id/eprint/422071
ISSN: 0302-9743
PURE UUID: 0b96cf7c-b03e-4847-aaa7-c02741a61276

Catalogue record

Date deposited: 16 Jul 2018 16:30
Last modified: 15 Mar 2024 20:52

Export record

Altmetrics

Contributors

Author: Michael Leuschel
Author: Stefan Gruner
Editor: A. Pettorossi

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×