50 search results - page 4 / 10 » csl 2010 |
CSL
2010
Springer
13 years 6 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
CSL
2010
Springer
13 years 6 months ago
2010
Springer
It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented i...
CSL
2010
Springer
13 years 6 months ago
2010
Springer
We present a new algorithm for model-checking weak monadic second-order logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipul...
CSL
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
FCSC
2010
13 years 3 months ago
2010
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...