Programming and Computer Software

, Volume 33, Issue 1, pp 14–23 | Cite as

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

  • A. P. Lisitsa
  • A. P. Nemytykh


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).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Nemytykh, A.P. and Turchin, V.F., The Supercompiler SCP4: Sources, On-Line Demonstration, 2000,
  2. 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, Scholar
  3. 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. 4.
    Delzanno, G., Automatic Verification of Cache Coherence Protocols via Infinite-state Constraint-based Model Checking,
  5. 5.
    Turchin, V.F., Refal-5, Programming Guide and Reference Manual, Holyoke, MA: New England, 1989, Scholar
  6. 6.
    Turchin, V.F., The Concept of a Supercompiler, ACM Trans. Programming Languages Systems, 1986, vol. 8, pp. 292–325.CrossRefGoogle Scholar
  7. 7.
    Turchin, V.F., Turchin, D.V., Konyshev, A.P., and Nemytykh, A.P., Refal-5, Sources, Executable Modules, 2000,
  8. 8.
    Nemytykh, A.P., The Supercompiler SCP4: General Structure, Programmnye System: Teoriya i Primenenie, 2004, vol. 1, pp. 448–485,".Google Scholar
  9. 9.
    Bundy, A., The Automation of Proof by Mathematical Induction, in Handbook of Automated Reasoning, 2001, pp. 845–911.Google Scholar
  10. 10.
    Delzanno, G., Verification of Consistency Protocols via Infinite-State Symbolic Model Checking: A Case Study, Proc. of FORTE/PSTV, 2000, pp. 171–188.Google Scholar
  11. 11.
    Korlyukov, A.V., Manual on the SCP4 Supercompiler, 1999,
  12. 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, Sources and demonstration, 2002: Scholar
  13. 13.
    Kruskal, J.B., Well-Quasi-Ordering, the Tree Theorem, and Vaszonyi’s Conjecture, Trans. AMS, 1960, vol. 95, pp. 210–225.CrossRefMathSciNetGoogle Scholar
  14. 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.MathSciNetGoogle Scholar
  15. 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, Scholar

Copyright information

© Pleiades Publishing, Ltd. 2007

Authors and Affiliations

  • A. P. Lisitsa
    • 1
  • A. P. Nemytykh
    • 2
  1. 1.Department of Computer ScienceThe University of LiverpoolLiverpoolUK
  2. 2.Institute of Program SystemsRussian Academy of SciencesYaroslavskaya oblastRussia

Personalised recommendations