Results 1 
6 of
6
Automatic Verification of Counter Systems via DomainSpecific MultiResult
"... Abstract. We consider an application of supercompilation to the analysis of counter systems. Multiresult 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 m ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
(Show Context)
Abstract. We consider an application of supercompilation to the analysis of counter systems. Multiresult 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 domainspecific and multiresult supercompilation may produce a synergistic effect. Lowcost implementations of domainspecific supercompilers can be produced by using prefabricated components provided by the MRSC toolkit. 1
Overgraph Representation for MultiResult
"... Abstract. In this paper we present a new approach to multiresult supercompilation based on joining together process graphs into a single graph and welding nodes corresponding to equal configurations. We show that this leads to a considerable reduction of nodes being built during supercompilation an ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In this paper we present a new approach to multiresult supercompilation based on joining together process graphs into a single graph and welding nodes corresponding to equal configurations. We show that this leads to a considerable reduction of nodes being built during supercompilation and enables more efficient configuration graph processing algorithms on the example of an enhanced residualization algorithm. 1
KELDYSH INSTITUTE OF APPLIED MATHEMATICS Russian Academy of Sciences
"... piler for MartinLöf ’s typetheory The paper describes the design and implementation of a certifying supercompiler TT Lite, which takes an input program and produces a residual program paired with a proof of the fact that the residual program is equivalent to the input one. As far as we can judge ..."
Abstract
 Add to MetaCart
(Show Context)
piler for MartinLöf ’s typetheory The paper describes the design and implementation of a certifying supercompiler TT Lite, which takes an input program and produces a residual program paired with a proof of the fact that the residual program is equivalent to the input one. As far as we can judge from the literature, this is the first implementation of a certifying supercompiler for a nontrivial higherorder functional language. The proof generated by TT Lite can be verified by a type checker which is independent from the supercompiler and is not based on supercompilation. This is essential in cases where the reliability of results obtained by supercompilation is of fundamental importance.
Russian Academy of Sciences
"... Automatic verification of counter systems via domainspecific multiresult supercompilation ..."
Abstract
 Add to MetaCart
(Show Context)
Automatic verification of counter systems via domainspecific multiresult supercompilation
Certifying supercompilation for MartinLöf’s type theory
"... Abstract. The paper describes the design and implementation of a certifying supercompiler TT Lite SC, which takes an input program and produces a residual program and a proof of the fact that the residual program is equivalent to the input one. As far as we can judge from the literature, this is th ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. The paper describes the design and implementation of a certifying supercompiler TT Lite SC, which takes an input program and produces a residual program and a proof of the fact that the residual program is equivalent to the input one. As far as we can judge from the literature, this is the first implementation of a certifying supercompiler for a nontrivial higherorder functional language. The proofs generated by TT Lite SC can be verified by a type checker which is independent from TT Lite SC and is not based on supercompilation. This is essential in cases where the reliability of results obtained by supercompilation is of fundamental importance. Currently, the proofs can be either verified by the typechecker built into TT Lite, or converted into Agda programs and checked by the Agda system. The main technical contribution is a simple but intricate interplay of supercompilation and type theory. 1
KELDYSH INSTITUTE OF APPLIED MATHEMATICS Russian Academy of Sciences
"... Automatic verification of counter systems via domainspecific multiresult supercompilation ..."
Abstract
 Add to MetaCart
(Show Context)
Automatic verification of counter systems via domainspecific multiresult supercompilation