158,39 €
175,99 €
-10% with code: EXTRA
Reasoning in Combinations of Theories
Reasoning in Combinations of Theories
158,39
175,99 €
  • We will send in 10–14 business days.
Verification problems are often expressed in a language which mixes several theories. A natural question to ask is whether one can use decision procedures for individual theories to construct a decision procedure for the union theory. The setup considered in this book is that of one base theory which is extended by one or more theories. The question is if and when a given problem in the extended setting can be effectively reduced to an equivalent problem over the base theory. A case where this…
  • SAVE -10% with code: EXTRA

Reasoning in Combinations of Theories (e-book) (used book) | bookbook.eu

Reviews

Description

Verification problems are often expressed in a language which mixes several theories. A natural question to ask is whether one can use decision procedures for individual theories to construct a decision procedure for the union theory. The setup considered in this book is that of one base theory which is extended by one or more theories. The question is if and when a given problem in the extended setting can be effectively reduced to an equivalent problem over the base theory. A case where this is always possible is that of so-called local theory extensions. The theory of local extensions is developed and some applications are given. It will be shown that a suitable fragment of both the theory of arrays and the theory of pointers is local as well.Finally, the case of more than one theory extension is discussed. The reductive approach outlined above has become particularly relevant in recent years due to the rise of powerful solvers for background theories common in verification tasks. These so-called SMT-solvers effectively handle theories such as real linear or integer arithmetic.

EXTRA 10 % discount with code: EXTRA

158,39
175,99 €
We will send in 10–14 business days.

The promotion ends in 20d.02:52:45

The discount code is valid when purchasing from 10 €. Discounts do not stack.

Log in and for this item
you will receive 1,76 Book Euros!?

Verification problems are often expressed in a language which mixes several theories. A natural question to ask is whether one can use decision procedures for individual theories to construct a decision procedure for the union theory. The setup considered in this book is that of one base theory which is extended by one or more theories. The question is if and when a given problem in the extended setting can be effectively reduced to an equivalent problem over the base theory. A case where this is always possible is that of so-called local theory extensions. The theory of local extensions is developed and some applications are given. It will be shown that a suitable fragment of both the theory of arrays and the theory of pointers is local as well.Finally, the case of more than one theory extension is discussed. The reductive approach outlined above has become particularly relevant in recent years due to the rise of powerful solvers for background theories common in verification tasks. These so-called SMT-solvers effectively handle theories such as real linear or integer arithmetic.

Reviews

  • No reviews
0 customers have rated this item.
5
0%
4
0%
3
0%
2
0%
1
0%
(will not be displayed)