The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well established infrastructure supporting research, development, and deployment of first-ord...
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
— Recognition of digital signal type is an important topic for various applications. In this paper a method is presented that identifies different types of digital signals. This ...
In this paper, we propose to deploy type-theoretic techniques to the service description and composition verification. We define a flexible type system for modeling instances a...