360 search results - page 5 / 72 » Constraint Checking with Partial Information |
ACSD
2010
IEEE
13 years 5 months ago
2010
IEEE
We extend the partial order reduction algorithm of Clarke et al. [CJM00] to handle branching security protocols, such as optimistic fair exchange protocols. Applications of the pro...
INFORMS
2010
13 years 4 months ago
2010
use for constraint solving, abstract interpretation, spatial databases, and theorem proving. In this paper we develop new incremental algorithms for UTVPI constraint satisfaction a...
CONCUR
2007
Springer
14 years 1 months ago
2007
Springer
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...
EUROMICRO
2007
IEEE
14 years 1 months ago
2007
IEEE
Code model checking of software components suffers from the well-known problem of state explosion when applied to highly parallel components, despite the fact that a single compon...
COLING
1992
13 years 8 months ago
1992
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...