Skip to main content

Justification Based on Program Transformation

(Extended Abstract)

  • Conference paper
  • First Online:
Logic Based Program Synthesis and Transformation (LOPSTR 2002)

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

  • 164 Accesses

Abstract

Justifying the truth value of a goal resulting from query evaluation of a logic program corresponds to providing evidence, in terms of a proof, for this truth. Justification plays a fundamental role in automatic verification, especially model checking [1]. For instance it can be used for efficient generation of parse trees, synthesis controllers for embedded systems [7], etc.

Research partially supported by NSF awards EIA-9705998, CCR-9876242, IIS-0072927, EIA-9901602 and CCR-0205376.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. E.M. Clarke, O. Grumberg, K.L. McMillan, and X. Zhao. Efficient generation of counterexamples and witnesses in symbolic model checking. In Design Automation Conference, pages 424–435, 1995.

    Google Scholar 

  2. Hai-Feng Guo, C.R. Ramakrishnan, and I.V. Ramakrishnan. Speculative beats conservative justification. In International Conference on Logic Programming, pages 150–165, 2001.

    Google Scholar 

  3. Hai-Feng Guo, C.R. Ramakrishnan, and I.V. Ramakrishnan. Justification based on program transformation. Technical Report, 2002. Available from http://www.faculty.ist.unomaha.edu/hguo/papers/lopstr02/ext.pdf.

  4. J.W. Lloyd. Foundations of Logic Programming, Second Edition. Springer-Verlag, 1987.

    Google Scholar 

  5. A. Pettorossi and M. Proietti. Automatic derivation of logic programs by transformation. In Lecture Notes for the 2000 European Summer School on Logic, Language, and Information, 2000.

    Google Scholar 

  6. C.R Ramakrishnan, I.V. Ramakrishnan, S.A. Smolka, Y. Dong, X. Du, A. Roychoudhury, and V.N. Venkatakrishnan. Xmc: A logic programming based verification toolset. In Computer Aided Verification, 2000.

    Google Scholar 

  7. Parthasarathi Roop. Forced simulation: a formal approach to component based development of embedded systems, 2000. PhD thesis.

    Google Scholar 

  8. Abhik Roychoudhury, C. R. Ramakrishnan, and I. V. Ramakrishnan. Justifying proofs using memo tables. In Principles and Practice of Declarative Programming, pages 178–189, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guo, HF., Ramakrishnan, C.R., Ramakrishnan, I.V. (2003). Justification Based on Program Transformation. In: Leuschel, M. (eds) Logic Based Program Synthesis and Transformation. LOPSTR 2002. Lecture Notes in Computer Science, vol 2664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45013-0_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-45013-0_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40438-5

  • Online ISBN: 978-3-540-45013-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics