The automated composition of Web services is one of the most promising ideas and at the same time one of the most challenging research area for the taking off of serviceoriented a...
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
: Most automated reasoning tasks with practical applications can be automatically reformulated into a constraint solving task. A constraint programming platform can thus act as a u...
Model checking is a powerful automated technique mainly used for the verification of properties of reactive systems. In practice, model checkers are limited due to the state explos...
Model transformations provide a powerful capability to automate model refinements. However, the use of model transformation languages may present challenges to those who are unfami...