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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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.
Hai-Feng Guo, C.R. Ramakrishnan, and I.V. Ramakrishnan. Speculative beats conservative justification. In International Conference on Logic Programming, pages 150–165, 2001.
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.
J.W. Lloyd. Foundations of Logic Programming, Second Edition. Springer-Verlag, 1987.
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.
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.
Parthasarathi Roop. Forced simulation: a formal approach to component based development of embedded systems, 2000. PhD thesis.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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