CSL
2009
Springer
13 years 11 months ago
2009
Springer
We study Craig interpolation for fragments and extensions of propositional linear temporal logic (PLTL). We consider various fragments of PLTL obtained by restricting the set of te...
CSL
2009
Springer
13 years 11 months ago
2009
Springer
CSL
2009
Springer
13 years 11 months ago
2009
Springer
We investigate the relationship between two independently developed termination techniques for rst and higher-order rewrite systems. On the one hand, sized-types based termination...
CSL
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automa...
CSL
2009
Springer
13 years 11 months ago
2009
Springer
CSL
2009
Springer
13 years 11 months ago
2009
Springer
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level language...
CSL
2009
Springer
13 years 11 months ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
CSL
2009
Springer
13 years 11 months ago
2009
Springer
CSL
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
CSL
2009
Springer
13 years 11 months ago
2009
Springer
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...