CSL
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
CSL
2008
Springer
14 years 1 months ago
2008
Springer
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
CSL
2008
Springer
14 years 1 months ago
2008
Springer
Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of in...
CSL
2008
Springer
14 years 1 months ago
2008
Springer
We give a graph theoretical criterion on multiplicative additive linear logic (MALL) cut-free proof structures that exactly characterizes those whose interpretation is a hypercliqu...
CSL
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
CSL
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. We give a recursion-theoretic characterization of the complexity classes NCk
CSL
2008
Springer
14 years 1 months ago
2008
Springer
We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some &...
CSL
2008
Springer
14 years 1 months ago
2008
Springer
CSL
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
CSL
2008
Springer
14 years 1 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...