In this paper we study theory combinations over non-disjoint signatures in which hierarchical and modular reasoning is possible. We use a notion of locality of a theory extension parameterized by a closure operator on ground terms. We give criteria for recognizing these types of theory extensions. We then show that combinations of extensions of theories which are local in this extended sense also have a locality property and hence allow modular and hierarchical reasoning. We thus obtain parameterized decidability and complexity results for many (combinations of) theories important in verification
Many problems occurring in verification can be reduced to proving the satisfiability of conjunction...
We present a general framework which allows to identify complex theories important in verification ...
The goal of this paper is to illustrate the wide applicability in verification of results on local r...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
Many problems in computer science can be reduced to proving the satisfiability of conjunctions of li...
Many problems in computer science can be reduced to proving the satisfiability of conjunctions of li...
Many problems in mathematics and computer science can be reduced to proving the satisfiability of co...
Many problems occurring in verification can be reduced to proving the satisfiability of conjunctions...
\section*{Abstract} Verification problems are often expressed in a language which mixes several t...
Verification problems are often expressed in a language which mixes several theories. A natural ques...
We show that for special types of extensions of a base theory, which we call {\em local}, efficient ...
Many problems occurring in verification can be reduced to proving the satisfiability of conjunction...
Many problems occurring in verification can be reduced to proving the satisfiability of conjunction...
We present a general framework which allows to identify complex theories important in verification ...
The goal of this paper is to illustrate the wide applicability in verification of results on local r...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
Many problems in computer science can be reduced to proving the satisfiability of conjunctions of li...
Many problems in computer science can be reduced to proving the satisfiability of conjunctions of li...
Many problems in mathematics and computer science can be reduced to proving the satisfiability of co...
Many problems occurring in verification can be reduced to proving the satisfiability of conjunctions...
\section*{Abstract} Verification problems are often expressed in a language which mixes several t...
Verification problems are often expressed in a language which mixes several theories. A natural ques...
We show that for special types of extensions of a base theory, which we call {\em local}, efficient ...
Many problems occurring in verification can be reduced to proving the satisfiability of conjunction...
Many problems occurring in verification can be reduced to proving the satisfiability of conjunction...
We present a general framework which allows to identify complex theories important in verification ...
The goal of this paper is to illustrate the wide applicability in verification of results on local r...