535 search results - page 85 / 107 » Checking Computations in Polylogarithmic Time |
CSL
2009
Springer
13 years 11 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...
ICDT
2010
ACM
13 years 11 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
13 years 10 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 ...
HYBRID
2000
Springer
13 years 11 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 ...
TDSC
2008
13 years 7 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...