RUS  ENG
Full version
JOURNALS // Preprints of the Keldysh Institute of Applied Mathematics // Archive

Keldysh Institute preprints, 2012 019, 30 pp. (Mi ipmp37)

This article is cited in 2 papers

Automatic verification of counter systems via domain-specific multi-result supercompilation

A. V. Klimov, I. G. Klyuchnikov, S. A. Romanenko


Abstract: We consider an application of supercompilation to the analysis of counter transition systems. Multi-result supercompilation enables us to find the best versions of the analysis by generating a set of possible results that are then filtered according to some criteria. Unfortunately, the search space may be rather large. However,the search can be drastically reduced by taking into account the specifics of the domain. Thus, we argue that a combination of domain-specific and multi-result supercompilation may produce a synergistic effect. Low-cost implementations of domain-specific supercompilers can be produced by using prefabricated components provided by the MRSC toolkit.


 English version:
, 2012, 019 (PDF, 327 kB)


© Steklov Math. Inst. of RAS, 2024