1795 search results - page 229 / 359 » On the Complexity of Circuit Satisfiability |
97
Voted
CADE
2006
Springer
16 years 1 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
97
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
119
Voted
PODS
2008
ACM
16 years 28 days ago
2008
ACM
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
99
Voted
IPPS
2008
IEEE
15 years 7 months ago
2008
IEEE
High-performance microprocessors, e.g., multithreaded and multicore processors, are being implemented in embedded real-time systems because of the increasing computational require...
109
click to vote
ADHOCNOW
2008
Springer
15 years 7 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...