535 search results - page 85 / 107 » Checking Computations in Polylogarithmic Time |
120
click to vote
CSL
2009
Springer
15 years 5 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
116
click to vote
ICDT
2010
ACM
15 years 5 months ago
2010
ACM
Checking the correspondence between two or more database instances and enforcing it is a procedure widely used in practice without however having been explored from a theoretical ...
ICDT
2010
ACM
15 years 4 months ago
2010
ACM
Checking the correspondence between two or more database instances and enforcing it is a procedure widely used in practice without however having been explored from a theoretical ...
117
click to vote
HYBRID
2000
Springer
15 years 5 months ago
2000
Springer
In this paper, we formulate the problem of characterizing the stability of a piecewise affine (PWA) system as a verification problem. The basic idea is to take the whole Rn as the ...
148
click to vote
TDSC
2008
15 years 1 months ago
2008
Specifying and managing access control policies is a challenging problem. We propose to develop formal verification techniques for access control policies to improve the current s...