The satisfiability problems for CTL and CTL^@? are known to be EXPTIME-complete, resp. 2EXPTIME-complete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that use less temporal or propositional operators, the complexity may ...

We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a way that one may use any theory defined in Isabelle/HOLCF to construct ...

The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, probably, computing in general. In this paper, we apply two techniques from ...

Reynolds' view of a storage cell as an expression-acceptor pair has been widely used by researchers. We present a different way of organizing semantics of state, and in particular game semantics, by adding to typing contexts a zone for global state. ...

We give an intuitionistic view of Seely's interpretation of Martin-Lof's intuitionistic type theory in locally cartesian closed categories. The idea is to use Martin-Lof type theory itself as metalanguage, and E-categories, the appropriate notion of ...

We describe a method for proving the termination of graph transformation systems. The method is based on the fact that infinite reductions must include infinite 'creation chains', that is chains of edges in different graphs of the reduction sequence, ...

We give a method of constructing an interpolant for linear equality, and inequality constraints over the rational numbers. Our method is based on efficient rewriting techniques, and does not require the use of combination methods. The interpolant is ...

This paper presents an algorithm of proof search for positive formulas in minimal predicate logic. It is based on the LJB deduction system introduced in [Dowek, G. and Y. Jiang, Eigenvariables, bracketing and the decidability of positive minimal ...

We study the divergent-sensitive spectrum of weak bisimulation equivalences in the setting of process algebra. To represent the infinite behavior, we consider the prefix iteration extension of a fragment of Milner's CCS. The prefix iteration operator is ...

In the recent past, the reduction-based and the model-based methods to prove cut elimination have converged, so that they now appear just as two sides of the same coin. This paper details some of the steps of this transformation.

Mathematical texts can be computerized in many ways that capture differing amounts of the mathematical meaning. At one end, there is document imaging, which captures the arrangement of black marks on paper, while at the other end there are proof ...

In the context of Kolmogorov's algorithmic approach to the foundations of probability, Martin-Lof defined the concept of an individual random sequence using the concept of a constructive measure 1 set. Alternate characterizations use constructive ...

We prove the computability of Blochs constant by presenting the first algorithm for this constant.

In this paper we study properties of @S-definability over the reals without the equality test which is one of the main concepts in the logical approach to computability over continuous data [Korovina, Margarita V., and Oleg V. Kudinov, The Uniformity ...

This paper initiates the study of sets in Euclidean space R^n(n>=2) that are defined in terms of the dimensions of their elements. Specifically, given an interval I@?[0,1], we are interested in the connectivity properties of the set DIM^I consisting of ...

Countably based filter spaces have been suggested in the 1970's as a model for recursion theory on higher types. Weak limit spaces with a countable limit base are known to be the class of spaces which can be handled by the Type-2 Model of Effectivity (...

Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the numerical Newton iteration to yield fast root-approximation methods together ...

The theory of inner functions plays an important role in the study of bounded analytic functions. Inner functions are also very useful in applied mathematics. Two foundational results in this theory are Frostman's Theorem and the Factorization Theorem. ...

The interactive theorem prover developed in the KeY project, which implements a sequent calculus for JavaCard Dynamic Logic (JavaCardDL) is based on taclets. Taclets are lightweight tactics with easy to master syntax and semantics. Adding new taclets to ...

The type theory @lP corresponds to the logical framework LF. In this paper we present @lH, a variant of @lP where convertibility is not implemented by means of the customary conversion rule, but instead type conversions are made explicit in the terms. ...