2040 search results - page 192 / 408 » On the Complexity of Error Explanation |
139
click to vote
APLAS
2005
ACM
15 years 10 months ago
2005
ACM
Interpretation interpretation is a theory of effective abstraction and/or approximation of discrete mathematical structures as found in the semantics of programming languages, mod...
150
click to vote
PLDI
2004
ACM
15 years 10 months ago
2004
ACM
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...
124
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In multi-input multi-output (MIMO) detection, semidefinite relaxation (SDR) has been shown to be an efficient high-performance approach. For BPSK and QPSK, it has been found that S...
144
click to vote
SIAMDM
2008
15 years 4 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
165
click to vote
TVLSI
2008
15 years 4 months ago
2008
Exact approaches to combinational equivalence checking, such as automatic test pattern generation-based, binary decision diagrams (BDD)-based, satisfiability-based, and hybrid appr...