Abstraction-Based Partial Deduction for Solving Inverse Problems - A Transformational Approach to Software Verification

Abstract

ion-Based Partial Deduction for Solving Inverse Problems – A Transformational Approach to Software Verification (Extended Abstract) Robert Glück and Michael Leuschel 1 DIKU, Department of Computer Science, University of Copenhagen, DK-2100 Copenhagen, Denmark Email: glueck@diku.dk 2 Department of Electronics and Computer Science University of Southampton, Southampton SO17 1BJ, UK Email: mal@ecs.soton.ac.uk D. Bjørner, M. Broy, A.V. Zamulin (Eds.): Perspectives of System Informatics. Proceedings. LNCS 1755, pp. 93–100, 2000. c © Springer-Verlag Berlin Heidelberg 2000. Abstract. We present an approach to software verification by program inversion, exploiting recent progress in the field of automatic program transformation, partial deduction and abstract interpretation. Abstraction-based partial deduction can work on infinite state spaces and produce finite representations of infinite solution sets. We illustrate the potential of this approach for infinite model checking of safety properties.

DOI: 10.1007/3-540-46562-6_8

Extracted Key Phrases

2 Figures and Tables

Cite this paper

@inproceedings{Glck1999AbstractionBasedPD, title={Abstraction-Based Partial Deduction for Solving Inverse Problems - A Transformational Approach to Software Verification}, author={Robert Gl{\"{u}ck and Michael Leuschel}, booktitle={Ershov Memorial Conference}, year={1999} }