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

Keldysh Institute preprints, 2012 024, 21 pp. (Mi ipmp42)

This article is cited in 1 paper

Implementing a domain-specific multi-result supercompiler by means of the MRSC toolkit

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


Abstract: The paper presents a simple domain-specific multi-result supercompiler for counter systems implemented by means of the MRSC toolkit. The input language of the supercompiler is a non-deterministic domain-specific language meant for specifying models of communication protocols. The implementation of this DSL is based on “embedding” and the heavy use of higher-order constructs. There are presented 2 versions of the multi-result supercompiler. The first one implements a naive algorithm, which turns out to be rather inefficient. The second version exploits the specifics of the domain, thereby drastically reducing the number of generated graphs of configurations and the amount of resources consumed by supercompilation.


 English version:
, 2012, 024 (PDF, 300 kB)


© Steklov Math. Inst. of RAS, 2024