Formalizing and Implementing Multi-Result Supercompilation
نویسندگان
چکیده
The paper explains the principles of multi-result supercompilation. We introduce a formalism for representing supercompilation algorithms as rewriting rules for graphs of configurations. Some low-level technical details related to the implementation of multi-result supercompilation in MRSC are discussed. In particular, we consider the advantages of using spaghetti stacks for representing graphs of configurations.
منابع مشابه
Formalizing and Implementing Multi-Result Supercompilation (meta 2012)
The paper explains the principles of multi-result supercompilation. We introduce a formalism for representing supercompilation algorithms as rewriting rules for graphs of configurations. Some low-level technical details related to the implementation of multi-result supercompilation in MRSC are discussed. In particular, we consider the advantages of using spaghetti stacks for representing graphs...
متن کاملAutomatic Verification of Counter Systems via Domain- Specific Multi-result Supercompilation Automatic Verification of Counter Systems via Domain-specific Multi-result Supercompilation. Keldysh Automatic Verification of Counter Systems via Domain-specific Multi-result Supercompilation Moscow 2012
matic verification of counter systems via domain-specific multi-result supercompilation 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 ra...
متن کاملAutomatic verification of counter systems via domain-specific multi-result supercompilation (2012)
matic verification of counter systems via domain-specific multi-result supercompilation 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 ra...
متن کاملMrsc: a Toolkit for Building Multi-result Supercompilers Mrsc: a Toolkit for Building Multi-result Supercompilers Moscow 2011 Ilya Klyuchnikov, Sergei Romanenko. Mrsc: a Toolkit for Building Multi-result Supercompilers
The paper explains the principles of multi-result supercompilation. We introduce a formalism for representing supercompilation algorithms as rewriting rules for graphs of configurations. Some low-level technical details related to the implementation of multi-result supercompilation in MRSC are discussed. In particular, we consider the advantages of using spaghetti stacks for representing graphs...
متن کاملAutomatic verification of counter systems via domain-specific multi-result supercompilation
We consider an application of supercompilation to the analysis of counter 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 ...
متن کامل