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

Authors:
A. P. Lisitsa;A. P. Nemytykh
Affiliations:
Department of Computer Science, The University of Liverpool, Liverpool, UK L69 3BX;Institute of Program Systems, Russian Academy of Sciences, Yaroslavskaya oblast, Russia 152020
Venue:
Programming and Computing Software
Year:
2007

Citing 0
Cited 5

On one application of computations with oracle

Programming and Computing Software
Proving the equivalence of higher-order terms by means of supercompilation

PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
Solving coverability problem for monotonic counter systems by supercompilation

PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Higher-level supercompilation as a metasystem transition

Programming and Computing Software
A note on specialization of interpreters

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications

Quantified Score

Hi-index	0.00

Visualization

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