Skip to main content
SpringerLink
Log in

Verification as a parameterized testing (experiments with the SCP4 supercompiler)

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

Let a program-predicate t testing another program p with respect to a given postcondition be given. Concrete tests d (data of the program p) are input data for t. Let us consider the program t when values of its argument d are unknown. Then a proof of the fact that the prediate t is true for all input data of the program p is verification of p with respect to the given postcondition. In this paper, we describe experiments on automatic verification of a number of cache coherence protocols with the SCP4 supercompiler (an optimizer of programs written in the REFAL-5 functional language).

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Nemytykh, A.P. and Turchin, V.F., The Supercompiler SCP4: Sources, On-Line Demonstration, 2000, http://www.botik.ru/pub/local/scp/refal5/.

  2. Nemytykh, A.P., The Supercompiler SCP4: General Structure (Extended Abstract), Lecture Notes in Computer Science (Proc. of the 5th Int. Conf. Perspectives of System Informatics), 2003, vol. 2890, pp. 162–170, http://www.botik.ru/pub/local/scp/refal5/nemytykh_PSI03.ps.gz.

    Google Scholar 

  3. Delzanno, G., Automatic Verification of Parameterized Cache Coherence Protocols, Lecture Notes in Computer Science (Proc. 12th Int. Conf. Computer Aided Verification), 2003, vol. 1855, pp. 53–68.

    Google Scholar 

  4. Delzanno, G., Automatic Verification of Cache Coherence Protocols via Infinite-state Constraint-based Model Checking, http://www.disi.unige.it/person/DelzannoG/protocol.html.

  5. Turchin, V.F., Refal-5, Programming Guide and Reference Manual, Holyoke, MA: New England, 1989, http://www.botik.ru/pub/local/scp/refal5/.

    Google Scholar 

  6. Turchin, V.F., The Concept of a Supercompiler, ACM Trans. Programming Languages Systems, 1986, vol. 8, pp. 292–325.

    Article  Google Scholar 

  7. Turchin, V.F., Turchin, D.V., Konyshev, A.P., and Nemytykh, A.P., Refal-5, Sources, Executable Modules, 2000, http://www.botik.ru/pub/local/scp/refal5/.

  8. Nemytykh, A.P., The Supercompiler SCP4: General Structure, Programmnye System: Teoriya i Primenenie, 2004, vol. 1, pp. 448–485, ftp://ftp.botik.ru/pub/local/scp/refal5/GenStruct.ps.gz".

    Google Scholar 

  9. Bundy, A., The Automation of Proof by Mathematical Induction, in Handbook of Automated Reasoning, 2001, pp. 845–911.

  10. Delzanno, G., Verification of Consistency Protocols via Infinite-State Symbolic Model Checking: A Case Study, Proc. of FORTE/PSTV, 2000, pp. 171–188.

  11. Korlyukov, A.V., Manual on the SCP4 Supercompiler, 1999, http://www.refal.net/supercom.htm.

  12. Korlyukov, A.V. and Nemytykh, A.P., Supercompilation of Double Interpretation (How One Hour of the Machine’s Time Can Be Turned to One Second), Vestn. natsional’nogo tekh. univ. Khar’kovskogo politekhnicheskogo inst., 2004, vol. 1, pp. 123–150, http://www.refal.net/korlukov/scp2int/Karliukou_Nemytykh.pdf. Sources and demonstration, 2002: http://www.refal.net/:_korlukov/demo_scp4xslt.zip.

    Google Scholar 

  13. Kruskal, J.B., Well-Quasi-Ordering, the Tree Theorem, and Vaszonyi’s Conjecture, Trans. AMS, 1960, vol. 95, pp. 210–225.

    Article  MathSciNet  Google Scholar 

  14. Leuschel, M., Improving Homeomorphic Embedding for Online Termination, Lecture Notes in Computer Science (Proc. 8th Int. Workshop on Logic Program Synthesis and Transformation (LOPSTR)), 1998, vol. 1559, pp. 199–218.

    MathSciNet  Google Scholar 

  15. Lisitsa, A. and Nemytykh, A.P., Verification of Parameterized Systems Using Supercompilation. A Case Study, Proc. Third Workshop on Applied Semantics (APPSEM05), Hofmann, M. and Loidl, H.W., Eds., Ludwig Maximillians Universität Munchen, Fraunchiemsee, Germany, 2005, ftp://www.botik.ru/pub/local/scp/refal5/appsem_verification2005.ps.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Liverpool, Ashton Building, Ashton str., Liverpool, L69 3BX, UK

    A. P. Lisitsa

  2. Institute of Program Systems, Russian Academy of Sciences, Pereslavl’-Zalesskii, Yaroslavskaya oblast, 152020, Russia

    A. P. Nemytykh

Authors
  1. A. P. Lisitsa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. P. Nemytykh
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © A.P. Lisitsa, A.P. Nemytykh, 2007, published in Programmirovanie, 2007, Vol. 33, No. 1.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lisitsa, A.P., Nemytykh, A.P. Verification as a parameterized testing (experiments with the SCP4 supercompiler). Program Comput Soft 33, 14–23 (2007). https://doi.org/10.1134/S0361768807010033

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768807010033

Keywords

Search

Navigation