504 search results - page 37 / 101 » The Complexity of Symmetry-Breaking Formulas |
STOC
2003
ACM
14 years 10 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
CONCUR
1999
Springer
14 years 2 months ago
1999
Springer
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...
ISSTA
2010
ACM
13 years 12 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
PLANX
2007
13 years 11 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
TCS
2008
13 years 9 months ago
2008
Temporal logics and model-checking have proved successful to respectively express biological properties of complex biochemical systems, and automatically verify their satisfaction...