Skip to main content
SpringerLink
Log in

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

(Extended Abstract)

  • Conference paper
  • First Online:
Perspectives of System Informatics (PSI 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1755))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.M. Abramov, R. Glück. Semantics modifiers: An approach to non-standard semantics of programming languages. In M. Sato, Y. Toyama (eds.), International Symposium on Functional and Logic Programming, 247–270. World Scientific, 1998.

    Google Scholar 

  2. M. Bruynooghe, H. Vandecasteele, A. de Waal. Detecting Unsolvable Queries for Definite Logic Programs. In C. Palamidessi, H. Glaser, K. Meinke (eds.) Principles of Declarative Programming, LNCS 1490, 118–133. Springer-Verlag, 1998.

    Chapter  Google Scholar 

  3. R. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293–318, 1992.

    Article  Google Scholar 

  4. E.M. Clarke, E.A. Emerson, A. Sistla. Automatic verification of finite-state concurrent systems using temp. logic specifications. ACM TOPLAS, 8(2):244–263, 1986.

    Article  MATH  Google Scholar 

  5. E.M. Clarke, J.M. Wing. Formal methods: State of the art and future directions. ACM Computing Surveys, 28(4):626–643, 1996.

    Article  Google Scholar 

  6. C. Consel, S.C. Khoo. Parameterized partial evaluation. ACM TOPLAS, 15(3):463–493, 1993.

    Article  MathSciNet  Google Scholar 

  7. R. Glück. On the generation of specializers. Journal of Functional Programming, 4(4):499–514, 1994.

    Google Scholar 

  8. P. Hartel, M. Butler, A. Currie, P. Henderson, M. Leuschel, A. Martin, A. Smith, U. Ultes-Nitsche, B. Walters. Questions and answers about ten formal methods. In S. Gnesi, D. Latella (eds.) Formal Methods for Industrial Critical Systems, pages 179–203. Trento, Italy, 1999.

    Google Scholar 

  9. J. Hatcliff, M. Dwyer, S. Laubach. Staging analysis using abstraction-based program specialization. In C. Palamidessi, H. Glaser, K. Meinke (eds.) Principles of Declarative Programming, LNCS 1490, 134–151. Springer-Verlag, 1998.

    Chapter  Google Scholar 

  10. N.D. Jones. The essence of program transformation by partial evaluation and driving. In N.D. Jones, M. Hagiya, M. Sato (eds.) Logic, Language and Computation, LNCS 792, 206–224. Springer-Verlag, 1994.

    Chapter  Google Scholar 

  11. M. Leuschel. Program specialisation and abstract interpretation reconciled. In J. Jaffar (ed.) JICSLP’98, 220–234. MIT Press, 1998.

    Google Scholar 

  12. M. Leuschel, D. De Schreye. Logic program specialisation: How to be more specific. In H. Kuchen, S. Swierstra (eds.) Programming Languages: Implementations, Logics and Programs., LNCS 1140, 137–151. Springer-Verlag, 1996.

    Google Scholar 

  13. M. Leuschel, B. Martens, D. De Schreye. Controlling generalisation and polyvariance in partial deduction of normal logic programs. ACM TOPLAS, 20(1):208–258, 1998.

    Article  Google Scholar 

  14. Y.S. Ramakrishna, C.R. Ramakrishnan, I.V. Ramakrishnan, S.A. Smolka, T. Swift, D.S. Warren. Efficient model checking using tabled resolution. In O. Grumberg (ed.) Computer-Aided Verification, LNCS 1254, 143–154. Springer-Verlag, 1997.

    Google Scholar 

  15. B.J. Ross. Running programs backwards: The logical inversion of imperative computation. Formal Aspects of Computing, 9:331–348, 1997.

    Article  MATH  Google Scholar 

  16. K. Sagonas, T. Swift, D.S. Warren. XSB as an efficient deductive database engine. In Intern. Conference on the Management of Data, 442–453. ACM Press, 1994.

    Google Scholar 

  17. B. Steffen (ed.). Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1384. Springer-Verlag, 1998.

    Google Scholar 

  18. V.F. Turchin. Program transformation with metasystem transitions. Journal of Functional Programming, 3(3):283–313, 1993.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DIKU, Department of Computer Science, University of Copenhagen, DK-2100, Copenhagen, Denmark

    Robert Glück

  2. Department of Electronics and Computer Science, University of Southampton, Southampton, SO17 1BJ, UK

    Michael Leuschel

Authors
  1. Robert Glück
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Leuschel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information Technology, Technical University of Denmark, Bldg. 244, 2800, Lyngby, Denmark

    Dines Bjøner

  2. Computer Science Department, Technical University of Munich, Arcisstr. 21, 80290, Munich, Germany

    Manfred Broy

  3. A.P. Ershov Institute of Informatics Systems, av. Ac. Lavrentyev 6, Novosibirsk, 630090, Russia

    Alexandre V. Zamulin

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Glück, R., Leuschel, M. (2000). Abstraction-Based Partial Deduction for Solving Inverse Problems — A Transformational Approach to Software Verification. In: Bjøner, D., Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 1999. Lecture Notes in Computer Science, vol 1755. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46562-6_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-46562-6_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67102-2

  • Online ISBN: 978-3-540-46562-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation