We present second-order value numbering, a new optimization method for suppressing redundancy, in a version tailored to the application for optimizing the decision procedure of jMosel, a verification tool set for monadic second-order logic on strings (M2L(Str)). The method extends the well-known concept of value numbering to consider not merely values, but semantics transformers that can be efficiently pre-computed and help to avoid redundancy at the 2nd-order level. Since decision procedures for M2L are non-elementary, an optimization method like this can have a great impact on the execution time, even though our decision procedure comprises the analysis and optimization time for second-order value numbering. This is illustrated considerin...
AbstractMonadic second-order logic (MSOL) provides a general framework for expressing properties of ...
AbstractVarious recent results about monadic second order logic and its fragments are presented. The...
We consider simply typed lambda-calculus with fixpoints as a non-interpreted functional programming ...
Abstract: We present second-order value numbering, a new optimization method for suppressing redunda...
We show how the second-order monadic theory of strings can be used to specify hardware components an...
We present a new approach to hardware verification based on describing circuits in Monadic Second-or...
These notes present the essentials of first- and second-order monadic logics on strings with introdu...
The purpose of this article is to introduce Monadic Second-orderLogic as a practical means of specif...
International audienceWe compare the expressiveness of two extensions of monadic second-order logic ...
International audienceSecond-order arithmetic has two kinds of computational interpretations: via Sp...
We present a new approach to hardware verification based on describing circuits in Monadic Second-or...
The purpose of this article is to introduce Monadic Second-order Logic as a practical means of speci...
This document presents an implementation of several types of value numbering within the Massively Sc...
Second-order logic is the extension of first-order logic obtaining by introducing quantification of...
In the past years, extensions of monadic second-order logic (MSO) that can specify boundedness prope...
AbstractMonadic second-order logic (MSOL) provides a general framework for expressing properties of ...
AbstractVarious recent results about monadic second order logic and its fragments are presented. The...
We consider simply typed lambda-calculus with fixpoints as a non-interpreted functional programming ...
Abstract: We present second-order value numbering, a new optimization method for suppressing redunda...
We show how the second-order monadic theory of strings can be used to specify hardware components an...
We present a new approach to hardware verification based on describing circuits in Monadic Second-or...
These notes present the essentials of first- and second-order monadic logics on strings with introdu...
The purpose of this article is to introduce Monadic Second-orderLogic as a practical means of specif...
International audienceWe compare the expressiveness of two extensions of monadic second-order logic ...
International audienceSecond-order arithmetic has two kinds of computational interpretations: via Sp...
We present a new approach to hardware verification based on describing circuits in Monadic Second-or...
The purpose of this article is to introduce Monadic Second-order Logic as a practical means of speci...
This document presents an implementation of several types of value numbering within the Massively Sc...
Second-order logic is the extension of first-order logic obtaining by introducing quantification of...
In the past years, extensions of monadic second-order logic (MSO) that can specify boundedness prope...
AbstractMonadic second-order logic (MSOL) provides a general framework for expressing properties of ...
AbstractVarious recent results about monadic second order logic and its fragments are presented. The...
We consider simply typed lambda-calculus with fixpoints as a non-interpreted functional programming ...