4573 search results - page 561 / 915 » Automated Reasoning |
160
click to vote
CSL
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...
105
click to vote
CSL
2008
Springer
15 years 6 months ago
2008
Springer
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
134
Voted
CSL
2008
Springer
15 years 6 months ago
2008
Springer
Type-based termination is a semantically intuitive method that ensures termination of recursive definitions by tracking the size of datatype elements, and by checking that recursiv...
174
click to vote
CSL
2008
Springer
15 years 6 months ago
2008
Springer
This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local str...
147
click to vote
DEON
2008
Springer
15 years 6 months ago
2008
Springer
The security policy of an information system may include a wide range of different requirements. The literature has primarily focused on access and information flow control require...